Enumeration of certain affine invariant extended cyclic codes (Q1775547)

Let \(p\) be a prime and \(r\), \(e\), \(m\) positive integers such that \(r\mid e\) and \(e\mid m\). This paper is concerned with the enumeration of extended cyclic codes of length \(p^m\) over \(\mathbb F_{p^r}\) which are invariant under the affine linear group \(G_{m,e}= \text{ AGL}(\frac{m}{e},\mathbb F_{p^e})\). These codes were studied by several authors; see e.g. \textit{T. Kasami} et al. [Inf. Control 11, 475--496 (1967; Zbl 0169.51101)], \textit{T. P. Berger} and \textit{P. Charpin} [IEEE Trans. Inf. Theory 42, No 6, Pt. 2, 2194--2209 (1996; Zbl 0883.94012)] and \textit{P. Delsarte} [IEEE Trans. Inf. Theory 16, 760--769 (1970; Zbl 0209.22002)]. These codes are characterized by a reflexive and transitive relation \(\ll_e\) on \([0, p^m-1]\). In the usual way we have then a partially ordered set \(([0,p^m-1]/\sim,\ll_e)\). This approach does not give new insights for the enumeration problem. The author shows that the partially order set above is isomorphic to a partially ordered set \((\mathcal U, \prec)\), where \(\mathcal U=[0,m(p-1)/e]^e\) and \(\prec\) is defined by an \(e\)-dimensional simplicial cone. As a matter of fact, the geometry of the last pair provide with new tools for the enumeration problem. He shows that extended codes invariant under \(G_{m,e}\) are in one-to-one correspondence with ideals of \((\mathcal U, \prec)\) which are invariant under \(A^r\), being \(A\) a permutation circular matrix. Finally the author applies the approach of his paper to solve the enumeration problem for \(e=2\).