Cyclic codes of length 2p^n over finite chain rings
For a finite commutative ring \(R\) with unity we say that \(C\) is a linear code of length \(n\) over \(R\) if it is a submodule \(R^n.\) It is known that cyclic codes of length \(n\) over a ring \(R\) can be identified with the ideals of the group ring \(RA\), where \(A\) is the cyclic group of order \(n.\) For a field \(K\) with \(q\) elements and \(A\) a cyclic group of order \(2p^n\), such that \(o(q) =\varphi(p^n)\) in \(U(\mathbb{Z}_{2p^n})\) and \(B=\{1, d\}\) its 2-Sylow subgroup and maximal ideal \(M = \langle a\rangle. \) Extending previous results, the authors compute the minimum Hamming weights and dimensions of an extensive family of cyclic codes \(C=RA\left(a^k\left(\frac{1\pm d}{2}\right)e_i\right),\) with \(0\leq k < t\) of length \(2p^n\) where \(e_i,\) \(0\leq i\leq s,\) denote the primitive idempotents. The authors are using the Hamming weight while others weights are possible for codes over rings, such as the homogeneous weight. Under some restrictive hypothesis, the family of codes considered is the family of all minimal codes.
- An introduction to group rings
- Bounds on the Minimum Homogeneous Distance of the ${p^{r}}$-ary Image of Linear Block Codes Over the Galois Ring ${\hbox{GR}}(p^{r},m)$
- Constructions of self-dual codes over finite commutative chain rings
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- scientific article; zbMATH DE number 3687544 (Why is no real title available?)
- Idempotents in group algebras and minimal abelian codes
- Minimal cyclic codes of length \(2p^n\)
- Notes on linear codes over finite commutative chain rings
- On constacyclic codes over finite chain rings
- On repeated-root multivariable codes over a finite chain ring
- On the structure of linear and cyclic codes over a finite chain ring
- A note on negacyclic and cyclic codes of length \(p^s\) over a finite field of characteristic \(p\)
- Group algebras and coding theory
- scientific article; zbMATH DE number 5844200 (Why is no real title available?)
- The minimum Hamming distance of cyclic codes of length 2p^s
- scientific article; zbMATH DE number 50283 (Why is no real title available?)
- scientific article; zbMATH DE number 1395937 (Why is no real title available?)
- Some cyclic codes of length \(2p^n\)
This page was built for publication: Cyclic codes of length \(2p^n\) over finite chain rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176290)
