An algorithm for computing the automorphism group of a Hadamard matrix
From MaRDI portal
Publication:1140154
DOI10.1016/0097-3165(79)90018-9zbMath0435.20002OpenAlexW1994047382MaRDI QIDQ1140154
Publication date: 1979
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(79)90018-9
algorithmsautomorphism groupHadamard matrixpermutation matrixbacktrack searchgroup of signed permutations
Theory of matrix inversion and generalized inverses (15A09) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Software, source code, etc. for problems pertaining to group theory (20-04) Algorithms in computer science (68W99)
Related Items
A general backtrack algorithm for the isomorphism problem of combinatorial objects, Some new Hadamard matrices, Hadamard graphs. II, Affine Equivalency and Nonlinearity Preserving Bijective Mappings over $$\mathbb {F}_2$$, Computing Autotopism Groups of Partial Latin Rectangles, Optimal quaternary linear codes with one-dimensional Hermitian hull and related EAQECCs, Degree of isomorphism: a novel criterion for identifying and classifying orthogonal designs, On the hulls of cyclic codes of oddly even length over \(\mathbb{Z}_4\), New Hadamard matrix of order 24, Deciding Hadamard equivalence of Hadamard matrices, Classification of 3-(24, 12, 5) designs and 24-dimensional Hadamard matrices, Self-dual codes over GF(5), A survey and evaluation of methods for determination of combinatorial equivalence of factorial designs, Hulls of cyclic and negacyclic codes over finite fields, Automorphisms of higher-dimensional Hadamard matrices, Linear codes with one-dimensional hull associated with Gaussian sums, Permutation group approach to association schemes, A Hadamard matrix of order 36, Hermitian hulls of constacyclic codes and their applications to quantum codes
Cites Work
