2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/167416A 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, 2008Information TheoryDiscrete Mathematicstext