## 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
Construction of some Hadamard matrices with maximum excess
β Scribed by Christos Koukouvinos; Stratis Kounias
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 300 KB
- Volume
- 85
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Koukouvinos, C. and J. Seberry, Hadamard matrices of order =8(mod 16) with maximal excess, Discrete Mathematics 92 (1991) 173-176. Kounias and Farmakis, in 'On the excess of Hadamard matrices', Discrete Math. 68 (1988) 59-69, showed that the maximal excess (or sum of the elements) of an Hadamard mat
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
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 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