Interleaved reed-solomon codes in concatenated code designs

Georg Schmidt, Vladimir R. Sidorenko, Martin Bossert

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

11 Citations (Scopus)

Abstract

Interleaved Reed-Solomon codes allow the correction of errors beyond half the minimum code distance if the errors are not distributed independently in the received signal but occur in bursts. Therefore, these codes are mainly considered for applications in channels, that cause correlated error patterns, i.e., error bursts. However, they can also be quite interesting for memoryless channels causing independent random errors, if they are applied in concatenated code designs. We present such concatenated codes with several outer Reed-Solomon codewords and demonstrate the gain, that can be obtained by interleaved Reed-Solomon decoding in comparison to independently decoding the several words of the underlying Reed-Solomon codes.

Original languageEnglish
Title of host publicationProceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005
Pages187-191
Number of pages5
DOIs
Publication statusPublished - 2005
Externally publishedYes
EventIEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005 - Rotorua, New Zealand
Duration: 29 Aug 20051 Sep 2005

Publication series

NameProceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005

Conference

ConferenceIEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005
Country/TerritoryNew Zealand
CityRotorua
Period29/08/051/09/05

Fingerprint

Dive into the research topics of 'Interleaved reed-solomon codes in concatenated code designs'. Together they form a unique fingerprint.

Cite this