Negacyclic self-dual codes over finite chain rings
From MaRDI portal
Publication:663474
DOI10.1007/s10623-011-9500-6zbMath1243.94039OpenAlexW2033882492MaRDI QIDQ663474
Publication date: 15 February 2012
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-011-9500-6
Related Items
Enumeration formulas for self-dual cyclic codes ⋮ A note on self-dual negacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^k} + u\mathbb{F}_{p^k}\) ⋮ New quantum codes from self-orthogonal cyclic codes over \(\mathbb{F}_{q^2}[u/\langle u^k \rangle\)] ⋮ Construction of self-dual MDR cyclic codes over finite chain rings ⋮ On constacyclic codes over finite chain rings ⋮ Left dihedral codes over Galois rings \(\mathrm{GR}(p^2, m)\) ⋮ Repeated-root constacyclic codes over \(\mathbb{F}_2 + u \mathbb{F}_2 + v \mathbb{F}_2 + u v \mathbb{F}_2\) ⋮ Construction of optimal codes from a class of constacyclic codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructions of self-dual codes over finite commutative chain rings
- MDS codes over finite principal ideal rings
- Dual and self-dual negacyclic codes of even length over \(\mathbb Z_{2^a}\)
- Cyclic codes over the integers modulo \(p^m\).
- On the structure of linear and cyclic codes over a finite chain ring
- Modular and \(p\)-adic cyclic codes
- Repeated-root cyclic and negacyclic codes over a finite chain ring
- Cyclic codes over \(\mathbb Z_4\) of even length
- Pseudocyclic maximum-distance-separable codes
- Negacyclic Codes of Length<tex>$2^s$</tex>Over Galois Rings
- Cyclic and Negacyclic Codes Over Finite Chain 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/
- MDR codes over Z/sub k/
- On the Hamming distance of linear codes over a finite chain ring
- Negacyclic codes over Z/sub 4/ of even length
- Algebraic Coding Theory
