Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs

DOI10.1109/TIT.2009.2021308MaRDI QIDQ4975910zbMATH OpenOpenAlexFDO

Authors Georg Schmidt, V. R. Sidorenko, Martin Bossert

Publication date 8 August 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0610074

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

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 multi-sequence 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 block code.

Cited in

(24)

• Improved power decoding of interleaved one-point Hermitian codes
• On syndrome decoding of punctured Reed-Solomon and Gabidulin codes
• Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff
• Simultaneous rational function reconstruction with errors: handling multiplicities and poles
• Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension
• Fast skew-feedback shift-register synthesis
• On multi-trial Forney-Kovalev decoding of concatenated codes
• Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability
• Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
• Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes
• Multitrial decoding of concatenated codes using fixed thresholds
• Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
• scientific article; zbMATH DE number 897548 (Why is no real title available?)
• Multiple-Layer Integrated Interleaved Codes: A Class of Hierarchical Locally Recoverable Codes
• Fractional decoding of \(r\)-Hermitian codes
• Fast decoding of lifted interleaved linearized Reed-Solomon codes for multishot network coding
• Fractional decoding and the Rosenbloom-Tsfasman metric
• Polynomial linear system solving with random errors. New bounds and early termination technique
• Fast decoding of interleaved linearized Reed-Solomon codes and variants
• Generalizing the Augot-Finiasz PKE to other code classes
• Simultaneous rational number codes: decoding beyond half the minimum distance with multiplicities and bad primes
• Decoding simultaneous rational evaluation codes
• A linear algebraic approach to multisequence shift-register synthesis
• Power error locating pairs

This page was built for publication: Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4975910)