In this note a method of construction of certain combinatorial designs is defined. This gives the solution of (121, 132, 60, 55, 27) which is marked as unknown by Kageyama [l].
On the construction of certain Hadamard designs
β Scribed by Marion E. Kimberley
- Publisher
- Springer-Verlag
- Year
- 1971
- Tongue
- French
- Weight
- 1016 KB
- Volume
- 119
- Category
- Article
- ISSN
- 0025-5874
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract A new lower bound on the number of nonβisomorphic Hadamard symmetric designs of even order is proved. The new bound improves the bound on the number of Hadamard designs of order 2__n__ given in [12] by a factor of 8__n__βββ1 for every odd __n__β>β1, and for every even __n__ such that 4_
In this paper, we present a new way of viewing Xia's construction of Hadamard difference sets. Based on this new point of view, we give a character theoretic proof for Xia's construction. Also we point out a connection between the construction and projective three-weight codes.
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