Affine invariant and cyclic codes over \(p\)-adic numbers and finite rings (Q5943692)

The extended code for a code is obtained by the addition of an overal parity check symbol. The classical paper [\textit{T. Kasami}, \textit{S. Lin} and \textit{W. W. Peterson}, Inf. Control 11, 475-496 (1967; Zbl 0169.51101)] characterizes cyclic codes of length \(p^m-1\) over \(\text{GF}(p)\) whose extension is affine invariant (\(p\) a prime number). In [\textit{A. R. Hammons}, \textit{P. V. Kumar}, \textit{A. R. Calderbank}, \textit{N. J. A. Sloane} and \textit{P. Solé}, IEEE Trans. Inf. Theory 40, 301-319 (1994; Zbl 0811.94039)] it was shown that various famous binary codes can be obtained as the binary image under the Gray map from linear codes over \(\mathbb{Z}/4\mathbb{Z}\). This paper stimulated investigations of linear codes over residue rings, which are closely related to codes over \(p\)-adic integers [\textit{A. R. Calderbank} and \textit{N. J. A. Sloane}, Des. Codes Cryptography 6, 21-35 (1995; Zbl 0848.94020)]. In the present paper, the author classifies affine invariant codes of length \(p^m\) over \(p\)-adic integers and integers modulo \(p^d\). In particular, he characterizes cyclic codes whose extensions are affine invariant. The author remarks himself that from an algebraic point of view, all work was done in earlier works by himself an integral lattices and that he has to translate these results into coding theory language.