THE AUTOMORPHISM GROUP OF GENERALIZED REED-MULLER CODES

We prove that the automorphism group of Generalized Reed-Muller codes is the general linear nonhomogeneous group. The Generalized Reed-Muller codes are introduced by Kasami, Lin and Peterson. An extensive study was made by Delsarte, Goethals and Mac-Williams; our result follows their description of the minimum weight codewords. An automorphism of a cyclic q-ary code is here a substitution over the field GF(q(m)). In the more general case where the automorphisms are defined by monomial matrices, we also obtain the automorphism group (called the monomial group) as the direct product of the general linear nonhomogeneous group with the multiplicative group of the alphabet field.