Decoding a class of Lee metric codes over a Galois ring

DOI10.1109/18.992804MaRDI QIDQ4674482zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Decoding a class of alternant codes for the Lee metric
• Hamming metric decoding of alternant codes over Galois rings
• Gröbner bases over Galois rings with an application to decoding alternant codes
• Publication:4945364
• Alternant and BCH codes over certain rings

Cited in

(9)

• scientific article; zbMATH DE number 2081150 (Why is no real title available?)
• Information set decoding in the Lee metric with applications to cryptography
• On structure and distances of some classes of repeated-root constacyclic codes over Galois rings
• Codes over Galois rings with respect to the Rosenbloom-Tsfasman metric
• Repeated-root constacyclic codes of prime power lengths over finite chain rings
• Hamming metric decoding of alternant codes over Galois rings
• Information set decoding for Lee-metric codes using restricted balls
• Decoding a class of alternant codes for the Lee metric
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4674482)