A transform approach to polycyclic and serial codes over rings (Q2123309)

This paper studies polycyclic and serial codes defined over a finite local ring \((R, m)\)\, of characteristic \(q=p^r\), using a generalization of the Mattson-Solomon transform.\par Polycyclic codes, a generalization of the classical error-correcting cyclic codes, where introduced by \textit{S. R. López-Permouth} et al. [Adv. Math. Commun. 3, No. 3, 227--234 (2009; Zbl 1191.94122)] and have been widely studied over finite fields, Galois rings and chain rings. They can be seen as ideals on the ring \(R_f=R[X]/(f(X)),\,\, f(X)\in R[X]\). In the present paper \(f(X)\)\, is supposed to be a monic polynomial with simple roots in the algebraic closure of \(\mathbf{F}_q\simeq R/m\). \par Sections 1 and 2 gather the necessary background about local rings, the Fourier transform over rings, etc. Section 3 gives the Mattson-Solomon transform with respect to \(f(X)\). Giving \(\mathcal{C}\)\, a code in \(R_f\)\, Theorem 3.3 shows that the dual of \(\mathcal{C}\)\, with respect to several inner products are the same and equal to \(\mathcal{C}^{\bot MS} =Ann({\mathcal{C}})\).\par Section 4, assuming \(f=f_1\cdots f_r\)\, a decomposition in irreducible polynomials, provides a decomposition (Theorem 4.2) generalization of the decomposition of \textit{M. Shi} et al. [Finite Fields Appl. 68, Article ID 101760, 14 p. (2020; Zbl 1465.94126)] while Section 5 investigates when two polynomial ambient spaces \(R_f, R_h\)\, (corresponding to polynomials \(f,g\)\, of equal degree) are isometrically equivalent.\par Finally Section 6 deals with the generalization to multivariable serial codes i.e. ideals of \(R[X_1,\dots ,X_r]/(f_1(X_1),\dots ,f_r(X_r)) \)\, (for simplicity the paper takes \(r=2\)). A multivariable transform approach is defined and similar results to Theorems 3.3 and 4.2 are proved (Theorems 6.4 and 6.6).