On linear codes admitting large automorphism groups (Q517270)

This article focusses on linear codes having large automorphism groups. One of the motivations is that large automorphism groups are of great relevance to allow permutation decoding of a linear code. The authors use the atlas of finite groups to construct linear codes having such large automorphism groups. Some of these codes with large automorphism groups turn out to be optimal, while others either are very close to, or achieve, the known lower bound on the theoretically largest minimum distance. After enumerating various linear codes with large automorphism groups, the article focusses on the permutation decoding of linear codes.