Limits to List Decoding Reed–Solomon Codes

DOI10.1109/TIT.2006.878164MaRDI QIDQ3547901zbMATH OpenFDO

Authors Atri Rudra, Venkatesan Guruswami

Publication date 21 December 2008

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

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

Mathematics Subject Classification ID

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

Cited in

(11)

• Improvements on the Johnson bound for Reed-Solomon codes
• Combinatorial Limitations of Average-Radius List Decoding
• Optimal Rate List Decoding via Derivative Codes
• scientific article; zbMATH DE number 6103506 (Why is no real title available?)
• scientific article; zbMATH DE number 7758332 (Why is no real title available?)
• Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings
• Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
• Point-polynomial incidences theorem with an application to Reed-Solomon codes
• Near-optimal list-recovery of linear code families
• List decoding of Reed-Solomon codes from a Gröbner basis perspective
• Key equations for list decoding of Reed-Solomon codes and how to solve them

This page was built for publication: Limits to List Decoding Reed–Solomon Codes

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