Decoding of concatenated codes with interleaved outer codes

Jørn Justesen, Tom Høholdt, Christian Thommesen

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearch

305 Downloads (Pure)


Recently Bleichenbacher et al. proposed a decoding algorithm for interleaved (N, K) Reed-Solomon codes, which allows close to N-K errors to be corrected in many cases. We discuss the application of this decoding algorithm to concatenated codes.
Original languageEnglish
Title of host publicationIEEE International Symposium on Information Theory, Proceedings
Place of PublicationChicago
Publication date2004
ISBN (Print)0-7803-8280-3
Publication statusPublished - 2004
Event2004 IEEE International Symposium on Information Theory - Chicago Downtown Marriott, Chicago, IL, United States
Duration: 27 Jun 20042 Jul 2004


Conference2004 IEEE International Symposium on Information Theory
LocationChicago Downtown Marriott
CountryUnited States
CityChicago, IL
Internet address

Bibliographical note

Copyright: 2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

Fingerprint Dive into the research topics of 'Decoding of concatenated codes with interleaved outer codes'. Together they form a unique fingerprint.

Cite this