On the structure of repeated-root polycyclic codes over local rings (Q6056443)

In 2009, \textit{S. R. López-Permouth} et al. [Adv. Math. Commun. 3, No. 3, 227--234 (2009; Zbl 1191.94122)] introduced Polycyclic codes, a generalization of the classical error-correcting cyclic codes. These codes 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]\), where \(R\) denotes a finite local ring of characteristic \(q = p^r\) for a prime \(p\) and a positive integer \(r\), \(\mathfrak{m}\) denotes the maximal ideal of \(R\) and \(\mathbb{F}_q = R/\mathfrak{m}\) is the finite residue field of \(R\). In the paper under review, the authors complete the study on Generalized Mattson Solomon polynomial (GMS) for polycyclic codes over local rings in the case that the defining polynomial has repeated-roots that gives an explicit decomposition of them in terms of idempotent. They also give a matrix product code structure that describes repeated-root polycyclic codes over finite fields. Finally, they provide expressions for the \(\bot_0\) dual code of a given polycyclic code.