Designs, Codes and Cryptography

, Volume 58, Issue 1, pp 73–88

The cocyclic Hadamard matrices of order less than 40


DOI: 10.1007/s10623-010-9385-9

Cite this article as:
Ó Catháin, P. & Röder, M. Des. Codes Cryptogr. (2011) 58: 73. doi:10.1007/s10623-010-9385-9


In this paper all cocyclic Hadamard matrices of order less than 40 are classified. That is, all such Hadamard matrices are explicitly constructed, up to Hadamard equivalence. This represents a significant extension and completion of work by de Launey and Ito. The theory of cocyclic development is discussed, and an algorithm for determining whether a given Hadamard matrix is cocyclic is described. Since all Hadamard matrices of order at most 28 have been classified, this algorithm suffices to classify cocyclic Hadamard matrices of order at most 28. Not even the total numbers of Hadamard matrices of orders 32 and 36 are known. Thus we use a different method to construct all cocyclic Hadamard matrices at these orders. A result of de Launey, Flannery and Horadam on the relationship between cocyclic Hadamard matrices and relative difference sets is used in the classification of cocyclic Hadamard matrices of orders 32 and 36. This is achieved through a complete enumeration and construction of (4t, 2, 4t, 2t)-relative difference sets in the groups of orders 64 and 72.


Cocyclic Hadamard matricesRelative difference setsClassification of Hadamard matrices

Mathematics Subject Classification (2000)


Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.School of Mathematics, Statistics and Applied MathematicsNational University of IrelandGalwayIreland