On the classification of Hadamard matrices of order 32

DOI10.1002/jcd.20245zbMath1209.05037MaRDI QIDQ3057079

B. Tayfeh-Rezaie, Hadi Kharaghani

Publication date: 24 November 2010

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20245

zbMATH Keywords

Hadamard matrices; orderly algorithm; free generation; classification of combinatorial objects; isomorph

Mathematics Subject Classification ID

05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)

Related Items

Hadamard Matrices of Order 32, Hadamard matrices with few distinct types, Glass phenomenology in the hard matrix model, Unnamed Item, Orderly generation of Butson Hadamard matrices, On one construction method for Hadamard matrices, Some remarks on Hadamard matrices, Classification of difference matrices over cyclic groups, Hadamard matrices of order 32 and extremal ternary self-dual codes, Mappings of Butson-type Hadamard matrices, The maximal determinant of cocyclic (-1,1)-matrices over \(D_{2t}\), Remark on a result of Constantine, Equivalence of Butson-type Hadamard matrices, On D4t-Cocyclic Hadamard Matrices, On the Smith normal form of skew E-W matrices, Suitable Permutations, Binary Covering Arrays, and Paley Matrices, On Symmetric Designs and Binary 3-Frameproof Codes

Uses Software

• Hadamard

Cites Work

• A census of \(t\)-\((t+8,t+2,4)4\) designs, \(2\leq t\leq 4\)
• New Hadamard matrix of order 24
• Construction of Hadamard matrices of order 28
• Classification of Hadamard matrices of order 28 with Hall sets
• Classification of Hadamard matrices of order 28
• Classification of Hadamard matrices of order 24 and 28
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
• Isomorph-Free Exhaustive Generation
• Backtrack Programming
• A Hadamard matrix of order 428