List Decoding of Burst Errors
arXiv:0808.2837
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.
Submitted to IEEE Transactions on Information Theory, August 19, 2008