paper

Decoding of Interleaved Reed-Solomon Codes Using Improved Power Decoding

arXiv:1701.06555

Abstract

We propose a new partial decoding algorithm for -interleaved Reed--Solomon (IRS) codes that can decode, with high probability, a random error of relative weight at all code rates , in time polynomial in the code length . For , this is an asymptotic improvement over the previous state-of-the-art for all rates, and the first improvement for in the last years. The method combines collaborative decoding of IRS codes with power decoding up to the Johnson radius.

arXiv comment5 pages, accepted at IEEE International Symposium on Information Theory 2017

References in corpus (1)

Cited by in corpus (1)