Hadamard designs
HTML articles powered by AMS MathViewer
- by Edward Spence PDF
- Proc. Amer. Math. Soc. 32 (1972), 29-31 Request permission
Abstract:
It has already been shown, using a combinatorial argument, that a Hadamard design with each letter repeated once and only once can exist for 2, 4 and 8 letters only. In this paper the same result is proved by a different method which utilizes the underlying algebraic structure of such a Hadamard design.References
- Jennifer Wallis, Hadamard designs, Bull. Austral. Math. Soc. 2 (1970), 45–54. MR 258658, DOI 10.1017/S0004972700041599
- Richard Hubert Bruck, A survey of binary systems, Reihe: Gruppentheorie, Springer-Verlag, Berlin-Göttingen-Heidelberg, 1958. MR 0093552
Additional Information
- © Copyright 1972 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 32 (1972), 29-31
- MSC: Primary 05B30
- DOI: https://doi.org/10.1090/S0002-9939-1972-0299506-0
- MathSciNet review: 0299506