Collaborative decoding of interleaved Reed-Solomon codes and concatenated code designs

  • Authors:

  • Georg Schmidt;Vladimir R. Sidorenko;Martin Bossert

  • Affiliations:

  • Institute of Telecommunications and Applied Information Theory, Ulm University, Ulm, Germany;Institute of Telecommunications and Applied Information Theory, Ulm University, Ulm, Germany;Institute of Telecommunications and Applied Information Theory, Ulm University, Ulm, Germany

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2009

Quantified Score

Hi-index 754.96

Visualization

Abstract

Interleaved Reed-Solomon codes are applied in numerous data processing, data transmission, and data storage systems. They are generated by interleaving several codewords of ordinary Reed-Solomon codes. Usually, these codewords are decoded independently by classical algebraic decoding methods. However, by collaborative algebraic decoding approaches, such interleaved schemes allow the correction of error patterns beyond half the minimum distance, provided that the errors in the received signal occur in bursts. In this work, collaborative decoding of interleaved Reed-Solomon codes by multisequence shift-register synthesis is considered and analyzed. Based on the framework of interleaved Reed-Solomon codes, concatenated code designs are investigated, which are obtained by interleaving several Reed-Solomon codes, and concatenating them with an inner code.