Bounds on list decoding of MDS codes

DOI10.1109/18.923744MaRDI QIDQ4544597zbMATH OpenOpenAlexFDO

Authors Tom Høholdt, Jørn Justesen

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.923744

zbMATH Keywords

list decodingmaximum-distance separable codes

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Recommendations

• Bounds on the List-Decoding Radius of Reed--Solomon Codes
• On the List and Bounded Distance Decodability of Reed–Solomon Codes
• Two theorems on list decoding (extended abstract)
• Combinatorial bounds for list decoding
• Improved decoding of Reed-Solomon and algebraic-geometry codes

Cited in

(7)

• On planes through points off the twisted cubic in \(\mathrm{PG}(3,q)\) and multiple covering codes
• On the list decodability of rank-metric codes containing Gabidulin codes
• scientific article; zbMATH DE number 493102 (Why is no real title available?)
• scientific article; zbMATH DE number 1792628 (Why is no real title available?)
• scientific article; zbMATH DE number 6103506 (Why is no real title available?)
• scientific article; zbMATH DE number 1420994 (Why is no real title available?)
• On the weight distribution of the cosets of MDS codes

This page was built for publication: Bounds on list decoding of MDS codes

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