On polycyclic codes over a finite chain ring
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.
- Codes over affine algebras with a finite commutative chain coefficient ring
- Contraction of cyclic codes over finite chain rings
- Cyclic codes and minimal strong Gröbner bases over a principal ideal ring.
- Dual generalizations of the concept of cyclicity of codes
- Finite rings with applications.
- scientific article; zbMATH DE number 3460471 (Why is no real title available?)
- scientific article; zbMATH DE number 2002850 (Why is no real title available?)
- scientific article; zbMATH DE number 3397423 (Why is no real title available?)
- On the duality and the direction of polycyclic codes
- On the structure of linear and cyclic codes over a finite chain ring
- On trace codes and Galois invariance over finite commutative chain rings
- Optimum shortened cyclic codes for burst-error correction
- Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes
- Rational power series, sequential codes and periodicity of sequences
- The Galois variance of constacyclic codes
- Polycyclic codes as invariant subspaces
- On the structure of 1-generator quasi-polycyclic codes over finite chain rings
- On \(\mathbb{Z}_2\mathbb{Z}_4\)-additive polycyclic codes and their Gray images
- \((f, \sigma, \delta)\)-skew polycyclic codes and their applications to quantum codes
- A transform approach to polycyclic and serial codes over rings
- Hermitian LCD codes over \(\mathbb{F}_{q^2}+u \mathbb{F}_{q^2}\) and their applications to maximal entanglement EAQECCs
- Polycyclic codes associated with trinomials: good codes and open questions
- Do non-free LCD codes over finite commutative Frobenius rings exist?
- \(\sigma\)-LCD codes over finite chain rings
- Codes over finite quotients of polynomial rings
- On trace codes and Galois invariance over finite commutative chain rings
- Polycyclic codes over \(\mathbb{F}_{p^m} [u] / \langle u^2 \rangle \): classification, Hamming distance, and annihilators
- Polynomial realization of sequential codes over finite fields
- Polycyclic codes and sequential codes over finite commutative QF rings
- On the duality and the direction of polycyclic codes
- scientific article; zbMATH DE number 3987200 (Why is no real title available?)
- scientific article; zbMATH DE number 7365014 (Why is no real title available?)
- On skew polycyclic codes over \(\mathbb{Z}_4[u]/\langle u^2-2\rangle\)
- On the structure of repeated-root polycyclic codes over local rings
- Equivalence and duality of polycyclic codes associated with trinomials over finite fields
- On the polycyclic codes over \(\mathbb{F}_q +u\mathbb{F}_q\)
- Quasi-polycyclic and skew quasi-polycyclic codes over \(\mathbb{F}_q\)
- Quantum codes from the polycyclic codes over the ring \(\mathbb{F}_q[u, v]/ \langle u^2 = u, v^2 = v, uv = vu \rangle\)
- Polycyclic codes over R
- Polycyclic codes over the \(\mathbb{F}_q\)-algebra \(\mathbb{F}_q^l\) and their annihilator dual
- On the algebraic structure of \((\sigma, \bar{a})\)-polycyclic codes
- Counting double-polycyclic codes over a finite chain ring of nilpotency index two
- Correction to: ``Polycyclic codes over serial rings and their annihilator CSS construction
- Polycyclic codes over serial rings and their annihilator CSS construction
- Equivalence of families of polycyclic codes over finite fields
This page was built for publication: On polycyclic codes over a finite chain ring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2194507)
