On cyclic codes that are invariant under the general linear group

Using a polynomial approach to linear codes, one derives necessary and sufficient conditions for cyclic
q
-ary codes to be invariant under the general linear group of substitutions over an extension field of
GF(q)
. The important class of polynomial codes, introduced by Kasami, Lin, and Peterson, satisfy the conditions and several new results are obtained about some of these codes.