List Decoding of Burst Errors

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.

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2009-09, Vol.55 (9), p.4179-4190
Main Authors: Roth, R.M., Vontobel, P.O.
Format: Article
Language:English
Subjects:
Applied sciences
Burst errors
Bursting
Cities and towns
Codes
Coding, codes
Computer science
Data communication
Decoding
Error correction codes
Errors
Exact sciences and technology
Information theory
Information, signal and communications theory
Laboratories
Linear code
list decoding
Lists
Polynomials
Redundancy
Reed-Solomon codes
Reiger bound
resultant
Signal and communications theory
Telecommunications and information theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2009.2025538