Hamming metric decoding of alternant codes over Galois rings
From MaRDI portal
Publication:4544821
DOI10.1109/18.986002zbMath1071.94538OpenAlexW2101517582MaRDI QIDQ4544821
Eimear Byrne, Patrick Fitzpatrick
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.986002
Related Items (6)
Repeated-root constacyclic codes of prime power lengths over finite chain rings ⋮ On structure and distances of some classes of repeated-root constacyclic codes over Galois rings ⋮ Algebraic decoding of negacyclic codes over \({\mathbb Z_4}\) ⋮ Lattice of ideals of the polynomial ring over a commutative chain ring ⋮ Left dihedral codes over Galois rings \(\mathrm{GR}(p^2, m)\) ⋮ An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings
This page was built for publication: Hamming metric decoding of alternant codes over Galois rings