Enumeration of AGL( m3, Fp3)-Invariant Extended Cyclic Codes
Abstract
Let p be a prime and let r, e, m be positive integers such that r|e and e|m. The enumeration of linear codes of length pm over Fpr which are invariant under the affine linear group AGL( me, Fpe) is equivalent to the enumeration of certain ideals in a partially ordered set ( U, ) where U=\0,1,..., me(p-1)\e and is defined by an e-dimensional simplicial cone. When e=2, the enumeration problem was solved in an earlier paper. In the present paper, we consider the cases e=3. We describe methods for enumerating all AGL( m3, Fp3)-invariant linear codes of length pm over Fpr
0