Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability

DOI10.1007/S10623-012-9728-9MaRDI QIDQ2448071zbMATH OpenOpenAlexFDO

Authors Antonia Wachter-Zeh, Alexander Zeh, Martin Bossert

Publication date 29 April 2014

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-012-9728-9

zbMATH Keywords

(interleaved) Reed-Solomon codesfailure probabilityjoint error-correctionmulti-sequence shift-register synthesis

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Linear codes (general theory) (94B05) Decoding (94B35)

Review text

The article under review considers a probabilistic decoding algorithm for homogeneous interleaved Reed-Solomon codes (IRS), these codes can be understood as \(s\) parallel codewords of Reed-Solomon codes with same length and dimension. The algorithm may fail for non-unique solutions. This paper is an extension of [\textit{G. Schmidt} et al., Enhancing the correcting radius of interleaved Reed-Solomon decoding using syndrome extension techniques. In: IEEE International Symposium on Information Theory -- ISIT 2007 (2007)], which presented a probabilistic decoding algorithm for homogeneous IRS codes by virtually extended the IRS code. However, it did not combine codewords of the \(s\) codes. In this article, such combination is considered. The authors estimate the failure probability and compare their decoding radius and failure probability with other decoding algorithms. Moreover, they present some simulations.

Recommendations

• scientific article; zbMATH DE number 2038702
• Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes
• Decoding interleaved Reed-Solomon codes over noisy channels
• Publication:4945377
• Coding and Cryptography

Cites work

• A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
• A generalized Euclidean algorithm for multisequence shift-register synthesis
• A method for solving key equation for decoding goppa codes
• Algebraic coding theory
• Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs
• Cryptography and Coding
• Decoding of Reed Solomon codes beyond the error-correction bound
• Fast multi-sequence shift-register synthesis with the Euclidean algorithm
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Reconstructing curves in three (and higher) dimensional space from noisy data
• Reed-solomon codes for correcting phased error bursts
• Shift-register synthesis and BCH decoding
• Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis

Cited in

(11)

• Improved power decoding of interleaved one-point Hermitian codes
• Power decoding Reed-Solomon codes up to the Johnson radius
• Decoding interleaved Reed-Solomon codes over noisy channels
• Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes
• scientific article; zbMATH DE number 2038702 (Why is no real title available?)
• Decoding of Interleaved Alternant Codes
• Multiple-Layer Integrated Interleaved Codes: A Class of Hierarchical Locally Recoverable Codes
• Integrated interleaved codes as locally recoverable codes: properties and performance
• Coding and Cryptography
• Fast decoding of lifted interleaved linearized Reed-Solomon codes for multishot network coding
• Fast decoding of interleaved linearized Reed-Solomon codes and variants

This page was built for publication: Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability

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