Cyclic codes of length 2p^n over finite chain rings
From MaRDI portal
Publication:2176290
Recommendations
Cites work
- scientific article; zbMATH DE number 3687544 (Why is no real title available?)
- 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
- 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
Cited in
(7)- Some cyclic codes of length \(2p^n\)
- scientific article; zbMATH DE number 1395937 (Why is no real title available?)
- A note on negacyclic and cyclic codes of length \(p^s\) over a finite field of characteristic \(p\)
- The minimum Hamming distance of cyclic codes of length \(2p^s\)
- scientific article; zbMATH DE number 50283 (Why is no real title available?)
- Group algebras and coding theory
- scientific article; zbMATH DE number 5844200 (Why is no real title available?)
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)
