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 ar
The excess of complex Hadamard matrices
โ Scribed by H. Kharaghani; Jennifer Seberry
- Publisher
- Springer Japan
- Year
- 1993
- Tongue
- English
- Weight
- 358 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
Let N = N (q) be the number of nonzero digits in the binary expansion of the odd integer q. A construction method is presented which produces, among other results, a block circulant complex Hadamard matrix of order 2 ฮฑ q, where ฮฑ โฅ 2N -1. This improves a recent result of Craigen regarding the asympt
## 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