A sensitive algorithm for detecting the inequivalence of Hadamard matrices

DOI10.1090/S0025-5718-03-01539-4zbMath1034.68040OpenAlexW2084599657MaRDI QIDQ4452164

Kai-Tai Fang, Gennian Ge

Publication date: 12 February 2004

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-03-01539-4

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Factorial statistical designs (62K15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (7)

Block-circulant complex Hadamard matrices ⋮ Equivalence of factorial designs with qualitative and quantitative factors ⋮ A survey and evaluation of methods for determination of combinatorial equivalence of factorial designs ⋮ Measures of uniformity in experimental designs: A selective overview ⋮ An efficient algorithm for the identification of isomorphic orthogonal arrays ⋮ A Concise Guide to Complex Hadamard Matrices ⋮ Combinatorial Equivalence of Fractional Factorial Designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On efficient sparse integer matrix Smith normal form computations
• Necessary and sufficient conditions for three and four variable orthogonal designs in order 36
• 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
• Regular two-graphs on 36 vertices
• Hadamard matrices of order 36 with automorphisms of order 17
• On the isomorphism of fractional factorial designs

This page was built for publication: A sensitive algorithm for detecting the inequivalence of Hadamard matrices