论文信息 - Computing automorphism groups of error-correcting codes

Computing automorphism groups of error-correcting codes

An algorithm is described for computing the automorphism group of an error correcting code. The algorithm determines the order of the automorphism group and produces a set of monomial permutations which generate the group. It has been implemented on a computer and has been used successfully on a great number of codes of moderate length.

Jeffrey S. Leon | J. Leon

[1] Jeffrey S. Leon,et al. An Algorithm for Computing the Automorphism Group of a Hadamard Matrix , 1979, J. Comb. Theory, Ser. A.

[2] D. Knuth. Estimating the efficiency of backtrack programs. , 1974 .

[3] J. Leon. On an algorithm for finding a base and a strong generating set for a group given by generating permutations , 1980 .

[4] N. J. A. Sloane,et al. On ternary self-dual codes of length 24 , 1981, IEEE Trans. Inf. Theory.

[5] Charles C. Sims,et al. Computation with permutation groups , 1971, SYMSAC '71.