Optimal linear codes from matrix groups
New linear codes (sometimes optimal) over the finite field with q elements are constructed. In order to do this, an equivalence between the existence of a linear code with a prescribed minimum distance and the existence of a solution of a certain system of Diophantine linear equations is used. To reduce the size of the system of equations, the search for solutions is restricted to solutions with special symmetry given by matrix groups. This allows to find more than 400 new codes for the case q = 2, 3, 4, 5, 7, 9.
optimal linear code group of automorphisms incidence matrix lattice point enumeration