The Hamming distances of negacyclic codes of length \(2^s\) over \(GR (2^a , m )\)
From MaRDI portal
Publication:1031965
DOI10.1007/s11424-008-9066-1zbMath1178.94236OpenAlexW2040637848MaRDI QIDQ1031965
Publication date: 23 October 2009
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-008-9066-1
Related Items
A family of constacyclic codes over \(\mathbb F_{2} + u\mathbb F_{2} + v\mathbb F_{2} + uv\mathbb F_{2}\) ⋮ A class of constacyclic codes over \(\mathbb Z_{p^m}\)
Cites Work
- Unnamed Item
- Unnamed Item
- Negacyclic Codes of Length<tex>$2^s$</tex>Over Galois Rings
- Complete Distances of All Negacyclic Codes of Length $2^{s}$ Over $\BBZ _{2^{a}}$
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Negacyclic and cyclic codes over Z/sub 4/
- Binary images of cyclic codes over Z/sub 4/
- Negacyclic codes over Z/sub 4/ of even length
