In this paper all the so-called checkered Hadamard matrices of order 16 are determined (i.e., Hadamard matrices consisting of 16 square blocks H i j of order 4 such that H ii = J 4 and H i j J 4 = J 4 H i j = 0 for i = j and where J 4 is the all-one matrix of order 4). It is shown that the checkered
Enumeration of generalized Hadamard matrices of order 16 and related designs
β Scribed by P. B. Gibbons; R. Mathon
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 142 KB
- Volume
- 17
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
We investigate signings of symmetric GDD($16 \times 2^i$, 16, $2^{4-i}$)s over $Z_2$ for $1 \le i \le 3$. Beginning with $i=1$, at each stage of this process a signing of a GDD($16 \times 2^i$, 16, $2^{4-i}$) produces a GDD($16 \times 2^{i+1}$, 16, $2^{4-i-1}$). The initial GDDs ($i=1$) correspond to Hadamard matrices of order 16. For $i=3$, the GDDs are semibiplanes of order 16, and for $i=4$ the GDDs are semiplanes of order 16 which can be extended to projective planes of order 16. In this article, we completely enumerate such signings which include all generalized Hadamard matrices of order 16. We discuss the generation techniques and properties of the designs obtained during the search. Β© 2008 Wiley Periodicals, Inc. J Combin Designs 17: 119β135, 2009
π SIMILAR VOLUMES
## Abstract We show that 138 odd values of __n__<10000 for which a Hadamard matrix of order 4__n__ exists have been overlooked in the recent handbook of combinatorial designs. There are four additional odd __n__=191, 5767, 7081, 8249 in that range for which Hadamard matrices of order 4__n__ exist.
In this paper we determine all symmetric and non-symmetric 3-class association schemes such that for their adjacency matrices D i we have Hadamard matrix of order 16 (i.e. an Hadamard matrix consisting of 16 square blocks H i j of order 4 such that H ii = J 4 and H i j J 4 = J 4 H i j = 0). It appe
## Abstract All equivalence classes of Hadamard matrices of order at most 28 have been found by 1994. Order 32 is where a combinatorial explosion occurs on the number of Hadamard matrices. We find all equivalence classes of Hadamard matrices of order 32 which are of certain types. It turns out that
## Abstract It is known that all doublyβeven selfβdual codes of lengths 8 or 16, and the extended Golay code, can be constructed from some binary Hadamard matrix of orders 8, 16, and 24, respectively. In this note, we demonstrate that every extremal doublyβeven selfβdual [32,16,8] code can be const
## Abstract We construct two difference families on each of the cyclic groups of order 109, 145, and 247, and use them to construct skewβHadamard matrices of orders 436, 580, and 988. Such difference families and matrices are constructed here for the first time. The matrices are constructed by usin