List Decoding of Burst Errors
Ron M. Roth, Pascal O. Vontobel
TL;DR
This paper generalizes the Reiger bound for list decoding of burst errors and demonstrates that Reed-Solomon codes achieve this bound, advancing understanding of error correction limits.
Contribution
It introduces a generalized bound for list decoding of burst errors and proves Reed-Solomon codes attain this bound, highlighting their optimality.
Findings
Reiger bound generalized for list decoding of burst errors
Reed-Solomon codes attain the generalized bound
Advances in understanding error correction limits
Abstract
A generalization of the Reiger bound is presented for the list decoding of burst errors. It is then shown that Reed-Solomon codes attain this bound.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Error Correcting Code Techniques