On ‐Cocyclic Hadamard Matrices
- 28 July 2014
- journal article
- research article
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 23 (8) , 352-368
Abstract
A characterization of ‐cocyclic Hadamard matrices is described, depending on the notions of distributions, ingredients, and recipes. In particular, these notions lead to the establishment of some bounds on the number and distribution of 2‐coboundaries over to use and the way in which they have to be combined in order to obtain a ‐cocyclic Hadamard matrix. Exhaustive searches have been performed, so that the table in p. 132 in A. Baliga, K. J. Horadam, Australas. J. Combin., 11 (1995), 123–134 is corrected and completed. Furthermore, we identify four different operations on the set of coboundaries defining ‐cocyclic matrices, which preserve orthogonality. We split the set of Hadamard matrices into disjoint orbits, define representatives for them, and take advantage of this fact to compute them in an easier way than the usual purely exhaustive way, in terms of diagrams. Let be the set of cocyclic Hadamard matrices over having a symmetric diagram. We also prove that the set of Williamson‐type matrices is a subset of of size .Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Some New Orders of Hadamard and Skew‐Hadamard MatricesJournal of Combinatorial Designs, 2013
- The homological reduction method for computing cocyclic Hadamard matricesJournal of Symbolic Computation, 2009
- A system of equations for describing cocyclic Hadamard matricesJournal of Combinatorial Designs, 2008
- Hadamard Matrices and Their Applications2007
- Generation of Cocyclic Hadamard Matrices1995
- Cocyclic Development of DesignsJournal of Algebraic Combinatorics, 1993