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

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.