List Decoding of Burst Errors
classification
💻 cs.IT
cs.DMmath.IT
keywords
boundburstdecodingerrorslistattaincodesgeneralization
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.