An algorithm for computing the automorphism group of a Hadamard matrix

doi:10.1016/0097-3165(79)90018-9

Journal of Combinatorial Theory, Series A

Volume 27, Issue 3, November 1979, Pages 289-306

https://doi.org/10.1016/0097-3165(79)90018-9 Get rights and content

Under an Elsevier user license

open archive

Abstract

An algorithm for computing the automorphism group of a Hadamard matrix is described. It is shown how the algorithm may be modified to determine if two Hadamard matrices are equivalent.

Cited by (0)

^∗: Work partially supported by NSF Grant MCS76-03143. Computing services used in this research were provided by the Computer Center of the University of Illinois at Chicago Circle. Their assistance is gratefully acknowledged.