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 problem and some excess inequivalent matrices of order 32
β Scribed by W.H. Holzmann; H. Kharaghani; M.T. Lavassani
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 77 KB
- Volume
- 72
- Category
- Article
- ISSN
- 0378-3758
No coin nor oath required. For personal study only.
β¦ Synopsis
Let 4n be the order of an Hadamard matrix. It is shown that there is a regular complex Hadamard matrix of order 8n 2 . Five classes of excess-inequivalent Hadamard matrices of order 32 are introduced.
π SIMILAR VOLUMES
## 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
It has long been known that the molar refractions of solutions, Rn = {(n 2 -1)/(n 2 + 2}nVm, can be estimated from those of the separated components using additivity relations, but deviations from such rules have been large enough to prevent practical application (such as the calculation of excess v