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.
No takes yet. Share an insight, caveat, or question.
Jeffrey S. Leon (1982) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: