Advertisement

Generation of Cocyclic Hadamard Matrices

  • K. J. Horadam
  • W. de Launey
Part of the Mathematics and Its Applications book series (MAIA, volume 325)

Abstract

The theory of cocyclic development of designs is applied to binary matrices, and an algorithm for generating cocyclic binary matrices is outlined. The eventual goal is to generate and classify all cocyclic Hadamard matrices of small side, in terms of an underlying group G and a cocycle f : G × GZ 2. Preliminary results are presented and open problems are posed.

Keywords

Abelian Group Free Abelian Group Hadamard Matrice Hadamard Matrix Binary Matrice 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    K. S. Brown, Cohomology of groups, Graduate Texts in Math. 87, New York: Springer-Verlag, 1982.Google Scholar
  2. [2]
    W. de Launey, On the construction of n-dimensional designs from 2-dimensional designs, Australas. J. Combin. 1 (1990), 67–81.zbMATHGoogle Scholar
  3. [3]
    W. de Launey and K. J. Horadam, A weak difference set construction for higher-dimensional designs, Designs, Codes and Cryptography 3 (1993), 75–87.MathSciNetzbMATHCrossRefGoogle Scholar
  4. [4]
    D. L. Flannery, A method for calculating cocyclic matrices, Research Report No. 5, Department of Mathematics, Royal Melbourne Institute of Technology, March 1994.Google Scholar
  5. [5]
    A. Hedayat and W. D. Wallis, Hadamard matrices and their applications, Ann. Statist. 6, (1978) 1184–1238.MathSciNetzbMATHCrossRefGoogle Scholar
  6. [6]
    P. J. Hilton and U. Stammbach, A Course in Homological Algebra, Graduate Texts in Math. 4, New York: Springer-Verlag, 1971.CrossRefGoogle Scholar
  7. [7]
    K. J. Horadam and W. de Launey, Cocyclic development of designs, J. Algebraic Combinatorics 2 (1993) 267–290; Erratum, ibid. 3 (1994) 129.Google Scholar
  8. [8]
    J. Seberry and M. Yamada, Hadamard matrices, sequences and block designs, Chapter 11 in: J. H. Dinitz, D. R. Stinson (eds.), Contemporary Design Theory: A Collection of Surveys, New York: John Wiley & Sons, 1992.Google Scholar
  9. [9]
    P. J. Shlichta, Three and four-dimensional Hadamard matrices, Bull. Amer. Phys. Soc., ser. 11, (1971), 825–826.Google Scholar
  10. [10]
    P. J. Shlichta, Higher dimensional Hadamard matrices, IEEE Trans. Inform. Theory, 25 (1979), 566–572.MathSciNetzbMATHCrossRefGoogle Scholar
  11. [11]
    W. D. Wallis, Combinatorial designs, New York: Marcel Dekker, 1988.zbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1995

Authors and Affiliations

  • K. J. Horadam
    • 1
  • W. de Launey
    • 2
  1. 1.Department of MathematicsRMITMelbourneAustralia
  2. 2.Department of DefenceKingstonAustralia

Personalised recommendations