Cyclic codes of length 2p^n over finite chain rings
From MaRDI portal
Publication:2176290
DOI10.3934/AMC.2020017zbMATH Open1473.94150OpenAlexW2971481405WikidataQ122113076 ScholiaQ122113076MaRDI QIDQ2176290FDOQ2176290
Authors: A. T. Silva, C. 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
Recommendations
Cites Work
- On constacyclic codes over finite chain rings
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- Title not available (Why is that?)
- On the structure of linear and cyclic codes over a finite chain ring
- Idempotents in group algebras and minimal abelian codes
- An introduction to group rings
- On repeated-root multivariable codes over a finite chain ring
- Constructions of self-dual codes over finite commutative chain rings
- Minimal cyclic codes of length \(2p^n\)
- 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)$
- Notes on linear codes over finite commutative chain rings
Cited In (7)
- Some cyclic codes of length \(2p^n\)
- Title not available (Why is that?)
- Group algebras and coding theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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\)
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)
