On polycyclic codes over a finite chain ring (Q2194507): Difference between revisions

This paper explore polycyclic codes over finite chain rings. For a finite chain ring \(S\), these codes are identified with ideals of the quotient ring \(S[X]/\left\langle X^n- a(X) \right\rangle,\) where \(a(X)\) is a polynomial in \(S[X]\) such that the constant term be a unit. The intersection and sum of free polycyclic codes over \(S\) are characterized and the structure of non-free polycyclic codes is described by using strong Gröbner bases. It is shown that an \(S\)-linear code is polycyclic if and only if its dual is a sequential code. It is proved that the annihilator code and the euclidean orthogonal have the same type. The fact that the annihilator dual of polycyclic code (respectively free-polycyclic code) is also polycyclic code (respectively free-polycyclic code) is established. It is shown that the Galois image of non-free non-zero polycyclic codes is polycyclic and a Gröbner basis is provided. Necessary and sufficient condition for a free polycyclic code to be Galois-disjoint (respectively complete Galois disjoint) is given. The trace codes and restrictions of free polycyclic codes are characterized giving an analogue of Delsarte's theorem relating the trace code and the annihilator dual code.