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
Checkered Hadamard Matrices of Order 16
β Scribed by R.W. Goldbach; H.L. Claasen
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 112 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
β¦ Synopsis
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 Hadamard matrices of order 16 all belong to one of the Hall's classes I, II or III. Moreover the so-called block equivalency classes are determined.
π SIMILAR VOLUMES
## 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$
## 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.
## 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
We are concerned here with the existence problem of 16-modular circulant Hadamard matrices H of size 4p (p prime), satisfying the additional condition that any two rows at distance n=2 in H are strictly orthogonal. A necessary existence condition is p 1 mod 8: For p 1 mod 16; existence follows from
## 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