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

DOI10.1007/s10623-012-9728-9zbMath1312.94120OpenAlexW2043216985MaRDI QIDQ2448071

Martin Bossert, Antonia Wachter-Zeh, Alexander Zeh

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

failure probability(interleaved) Reed-Solomon codesjoint error-correctionmulti-sequence shift-register synthesis

Mathematics Subject Classification ID

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

Related Items

Improved power decoding of interleaved one-point Hermitian codes ⋮ Power decoding Reed-Solomon codes up to the Johnson radius

Cites Work

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