Decoding of interleaved Reed-Solomon codes using improved power decoding
Open Access
- 1 June 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 356-360
Abstract
We propose a new partial decoding algorithm for m-interleaved Reed-Solomon (IRS) codes that can decode, with high probability, a random error of relative weight 1 - R m / m + 1 at all code rates R, in time polynomial in the code length n. For m > 2, this is an asymptotic improvement over the previous state-of-the-art for all rates, and the first improvement for R > 1/3 in the last 20 years. The method combines collaborative decoding of IRS codes with power decoding up to the Johnson radius.Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Algorithms for Simultaneous Padé Approximations2016
- Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts2016
- Approximate common divisors via latticesThe Open Book Series, 2013
- Decoding interleaved Reed–Solomon codes beyond their joint error-correcting capabilityDesigns, Codes and Cryptography, 2012
- Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code DesignsIEEE Transactions on Information Theory, 2009
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal RedundancyIEEE Transactions on Information Theory, 2008
- Decoding of Interleaved Reed Solomon Codes over Noisy Data2003
- Improved decoding of Reed-Solomon and algebraic-geometric codes2002
- Decoding of Reed Solomon Codes beyond the Error-Correction BoundJournal of Complexity, 1997
- Decoding for iterative Reed-Solomon coding schemesIEEE Transactions on Magnetics, 1997