A useful tool for constructing linear codes (Q2042936)

The authors introduce and discuss an elementary tool from the representation theory of finite groups that can be used to construct linear codes invariant under a given permutation group. The tool can be used to achieve theoretical insight as well as a way to explicitly determine generator matrices and weight distributions of codes. The authors use this tool to find, study and sometimes classify several types of codes invariant under various permutation groups, including new codes and codes found previously using graph-theoretical methods. The former include codes obtained by considering invariances under the actions of the Mathieu group \(M_{24}\), the Conway simple group \(\textrm{Co}_1\), and some of their subgroups. The latter include binary codes related to triangular graphs, and a 23-dimensional code constructed by Hans-Jörg Schaeffer in 1980 but not previously published.