On the computation of the automorphism group of a linear code

摘要

We present here an algorithm for computing the automorphism group of a binary linear code. It is based on Leon's algorithm (1982), but the use of the support splitting algorithm in the refinement process allows us to address the problem for some very large codes.