Article ID Journal Published Year Pages File Type
4656122 Journal of Combinatorial Theory, Series A 2011 12 Pages PDF
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.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics