DocumentCode
2059755
Title
List decoding of concatenated codes: improved performance estimates
Author
Barg, Alexander ; McGregor, Andrew
Author_Institution
Maryland Univ., College Park, MD, USA
fYear
2004
fDate
27 June-2 July 2004
Firstpage
419
Abstract
An improved bound is proved on the list-decoding radius of a concatenated code relying upon a combination of (soft-decision) algebraic list decoding and generalized minimum distance (GMD) decoding in the outer level. This bound is further improved if the inner code is a random linear code.
Keywords
algebraic codes; concatenated codes; linear codes; probability; random codes; concatenated codes; generalized minimum distance decoding; probability; random linear code; soft-decision algebraic list decoding; Concatenated codes; Decoding; Educational institutions; Encoding; Error correction codes; Linear code; Reed-Solomon codes; Sufficient conditions;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN
0-7803-8280-3
Type
conf
DOI
10.1109/ISIT.2004.1365458
Filename
1365458
Link To Document