Decoding interleaved Reed–Solomon codes beyond their joint error-correcting capability
- 24 July 2012
- journal article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 71 (2) , 261-281
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Fast multi-sequence shift-register synthesis with the Euclidean algorithmAdvances in Mathematics of Communications, 2011
- Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code DesignsIEEE Transactions on Information Theory, 2009
- Reed-solomon codes for correcting phased error burstsIEEE Transactions on Information Theory, 2003
- Improved decoding of Reed-Solomon and algebraic-geometry codesIEEE Transactions on Information Theory, 1999
- Decoding of Reed Solomon Codes beyond the Error-Correction BoundJournal of Complexity, 1997
- Decoding for iterative Reed-Solomon coding schemesIEEE Transactions on Magnetics, 1997
- A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codesIEEE Transactions on Information Theory, 1991
- A generalized Euclidean algorithm for multisequence shift-register synthesisIEEE Transactions on Information Theory, 1989
- A method for solving key equation for decoding goppa codesInformation and Control, 1975
- Shift-register synthesis and BCH decodingIEEE Transactions on Information Theory, 1969