Decoding a class of Lee metric codes over a Galois ring

DOI10.1109/18.992804zbMath1061.94071OpenAlexW2125320584MaRDI QIDQ4674482

Eimear Byrne

Publication date: 11 May 2005

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.992804

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Decoding (94B35)

Related Items (4)

Information set decoding in the Lee metric with applications to cryptography ⋮ 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 ⋮ Left dihedral codes over Galois rings \(\mathrm{GR}(p^2, m)\)

This page was built for publication: Decoding a class of Lee metric codes over a Galois ring