Hadamard equivalence via graph isomorphism
From MaRDI portal
Publication:1255008
DOI10.1016/0012-365X(79)90113-4zbMath0401.05024OpenAlexW1976234548MaRDI QIDQ1255008
Publication date: 1979
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(79)90113-4
Related Items
A general backtrack algorithm for the isomorphism problem of combinatorial objects, DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS, On an inequivalence criterion for cocyclic Hadamard matrices, Enumeration of Seidel matrices, Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays, Classification of difference matrices over cyclic groups, Quantum isomorphism of graphs from association schemes, Quaternary complex Hadamard matrices of order 18, Deciding Hadamard equivalence of Hadamard matrices, A survey and evaluation of methods for determination of combinatorial equivalence of factorial designs, On the enumeration of some D-optimal designs, A sign test for detecting the equivalence of Sylvester Hadamard matrices, Improving the lower bounds on inequivalent Hadamard matrices through orthogonal designs and meta-programming techniques, Integer Programming for Classifying Orthogonal Arrays, 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, Hadamard 2-(63,31,15) designs invariant under the dihedral group of order 10, Supersaturated designs with the maximum number of factors for a given resolution-rank, Graph isomorphism problem
Cites Work
