Please use this identifier to cite or link to this item:
https://doi.org/10.1016/j.jcta.2010.10.004
DC Field | Value | |
---|---|---|
dc.title | Finiteness of circulant weighing matrices of fixed weight | |
dc.contributor.author | Leung, K.H. | |
dc.contributor.author | Schmidt, B. | |
dc.date.accessioned | 2014-10-28T02:35:18Z | |
dc.date.available | 2014-10-28T02:35:18Z | |
dc.date.issued | 2011-04 | |
dc.identifier.citation | Leung, K.H., Schmidt, B. (2011-04). Finiteness of circulant weighing matrices of fixed weight. Journal of Combinatorial Theory. Series A 118 (3) : 908-919. ScholarBank@NUS Repository. https://doi.org/10.1016/j.jcta.2010.10.004 | |
dc.identifier.issn | 00973165 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/103275 | |
dc.description.abstract | Let n be a fixed positive integer. Every circulant weighing matrix of weight n arises from what we call an irreducible orthogonal family of weight n. We show that the number of irreducible orthogonal families of weight n is finite and thus obtain a finite algorithm for classifying all circulant weighing matrices of weight n. We also show that, for every odd prime power q, there are at most finitely many proper circulant weighing matrices of weight q. © 2010 Elsevier Inc. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/j.jcta.2010.10.004 | |
dc.source | Scopus | |
dc.subject | Circulant weighing matrices | |
dc.subject | Field descent | |
dc.subject | Orthogonal families | |
dc.type | Article | |
dc.contributor.department | MATHEMATICS | |
dc.description.doi | 10.1016/j.jcta.2010.10.004 | |
dc.description.sourcetitle | Journal of Combinatorial Theory. Series A | |
dc.description.volume | 118 | |
dc.description.issue | 3 | |
dc.description.page | 908-919 | |
dc.description.coden | JCBTA | |
dc.identifier.isiut | 000288190800012 | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.