Computing automorphism groups of error-correcting codes
Jeffrey S. Leon · IEEE Transactions on Information Theory · 1982
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.