Hostname: page-component-848d4c4894-4hhp2 Total loading time: 0 Render date: 2024-06-08T20:08:14.076Z Has data issue: false hasContentIssue false

Relations Among Generalized Hadamard Matrices, Relative Difference Sets, and Maximal Length Linear Recurring Sequences

Published online by Cambridge University Press:  20 November 2018

A. T. Butson*
Affiliation:
Boeing Airplane Co.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

It was established in (5) that the existence of a Hadamard matrix of order 4t is equivalent to the existence of a symmetrical balanced incomplete block design with parameters v = 4t — 1, k = 2t — 1, and λ = t — 1. A block design is completely characterized by its so-called incidence matrix. The existence of a block design with parameters v, k, and λ such that the corresponding incidence matrix is cyclic was shown in (3) to be equivalent to the existence of a cyclic difference set with parameters v, k, and λ. For certain values of the parameters, Hadamard matrices, block designs, and difference sets do coexist.

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1963

References

1. Bose, R. C. and Shrikhande, S. S., On the composition of balanced incomplete block designs, Can. J. Math., 12 (1960), 177188.Google Scholar
2. Butson, A. T., Generalized Hadamard matrices, submitted to Proc. Amer. Math. Soc.Google Scholar
3. Chowla, S. and Ryser, H. J., Combinatorial problems, Can. J. Math., 2 (1950), 9399.Google Scholar
4. Hall, Marshall, Jr., A survey of difference sets, Proc. Amer. Math. Soc, 7 (1956), 975986.Google Scholar
5. Todd, J. A., A combinatorial problem, J. Math. Phys., 12 (1933), 321333.Google Scholar
6. Zierler, Neal, Linear recurring sequences, J. Soc. Indust. Appl. Math., 7 (1959), 3148.Google Scholar