The excess of Hadamard matrices and optimal designs
โ Scribed by Nikos Farmakis; Stratis Kounias
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 542 KB
- Volume
- 67
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
Hadamard matrices of order n with maximum excess o(n) are constructed for n = 40, 44, 48, 52, 80, 84. The results are: o(40)= 244, o(44)= 280, o(48)= 324, o(52)= 364, o(80)= 704, 0(84) = 756. A table is presented listing the known values of o(n) 0< n ~< 100 and the corresponding Hadamard matrices are constructed. For the remaining values of n = 56, 60, 68, 72, 76, 88, 92, 96 the largest values achieved for the excess are also given.
๐ SIMILAR VOLUMES
## Abstract Weaving is a matrix construction developed in 1990 for the purpose of obtaining new weighing matrices. Hadamard matrices obtained by weaving have the same orders as those obtained using the Kronecker product, but weaving affords greater control over the internal structure of matrices co
We show that if there is a skew-Hadamard matrix of order m then there is an Hadamard matrix of order 4m2 -4m whose excess attains the maximum possible bound predicted by S. Kounias and N. Farmakis, On the excess of Hadamard matrices, Discrete Mathematics 68 (1988) 59-69. That is a(4m\* -4m) = 4(m -1
## 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$