Cyclic codes of length \(2p^n\) over finite chain rings
From MaRDI portal
Publication:2176290
DOI10.3934/amc.2020017zbMath1473.94150OpenAlexW2971481405WikidataQ122113076 ScholiaQ122113076MaRDI QIDQ2176290
Anderson Silva, Francisco César Polcino Milies
Publication date: 4 May 2020
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2020017
Related Items
Cites Work
- Unnamed Item
- Constructions of self-dual codes over finite commutative chain rings
- Notes on linear codes over finite commutative chain rings
- Idempotents in group algebras and minimal abelian codes
- On repeated-root multivariable codes over a finite chain ring
- Minimal cyclic codes of length \(2p^n\)
- On the structure of linear and cyclic codes over a finite chain ring
- An introduction to group rings
- On constacyclic codes over finite chain rings
- Cyclic and Negacyclic Codes Over Finite Chain 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)$