Switching Operations for Hadamard Matrices

DOI10.1137/050641727MaRDI QIDQ3614193zbMATH OpenOpenAlexFDO

Authors W. P. Orrick

Publication date 16 March 2009

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0507515

zbMATH Keywords

Hadamard codeHadamard equivalenceHadamard matrixinteger equivalenceSmith normal form

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Matrices, determinants in number theory (11C20) Matrices of integers (15B36) Linear codes (general theory) (94B05)

Abstract: We define several operations that switch substructures of Hadamard matrices thereby producing new, generally inequivalent, Hadamard matrices. These operations have application to the enumeration and classification of Hadamard matrices. To illustrate their power, we use them to greatly improve the lower bounds on the number of equivalence classes of Hadamard matrices in orders 32 and 36 to 3,578,006 and 18,292,717.

Recommendations

• On Hadamard matrices
• scientific article; zbMATH DE number 17513
• scientific article; zbMATH DE number 510853
• Graph switching, 2-ranks, and graphical Hadamard matrices
• Hadamard matrices and their applications
• Hadamard matrices and their applications
• A generalization of Hadamard matrices
• A construction for Hadamard matrices
• On some applications of Hadamard matrices

Cited in

(21)

• 2-(31,15,7), 2-(35,17,8) and 2-(36,15,6) designs with automorphisms of odd prime order, and their related Hadamard matrices and codes
• Classification of Hadamard matrices of order 28 with Hall sets
• A rearrangement algorithm for switching networks composed of digital symmetrical matrices
• Robust Hadamard matrices, unistochastic rays in Birkhoff polytope and equi-entangled bases in composite spaces
• Gröbner bases and cocyclic Hadamard matrices
• Switching for 2-designs
• E(s^2)-optimal supersaturated designs with odd number of runs
• Graph switching, 2-ranks, and graphical Hadamard matrices
• On \(D_{4t}\)-cocyclic Hadamard matrices
• Trades in complex Hadamard matrices
• Orderly generation of Butson Hadamard matrices
• A Bird’s-Eye View of Modern Symmetric Cryptography from Combinatorial Designs
• A Path to Hadamard Matrices
• An infinite family of Hadamard matrices constructed from Paley type matrices
• Hadamard matrices of order 36 formed by codewords in some ternary self-dual codes
• The cocyclic Hadamard matrices of order less than 40
• A class of balanced binary sequences with two-valued non-zero autocorrelation sum and good crosscorrelation sum
• Switching codes and designs
• On regular quaternary Hadamard matrices
• A universal theory of switching for combinatorial objects, and applications to complex Hadamard matrices
• Switching graphs and Hadamard matrices

This page was built for publication: Switching Operations for Hadamard Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3614193)