List decoding of burst errors

Authors:
Ron M. Roth;Pascal O. Vontobel
Affiliations:
Computer Science Department, Technion-Israel Institute of Technology, Technion City, Haifa, Israel;Hewlett-Packard Laboratories, Palo Alto, CA
Venue:
IEEE Transactions on Information Theory
Year:
2009

Finite fields

Finite fields
Error Control Coding, Second Edition

Error Control Coding, Second Edition
Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Explicit capacity-achieving list-decodable codes

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)

Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
Reed-Solomon codes for correcting phased error bursts

IEEE Transactions on Information Theory

Novel burst error correcting algorithms for Reed-Solomon codes

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing

Hi-index	754.84

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.