Probabilistic decoding of interleaved RS-codes on the q-ary symmetric channel

We show that the error probability for decoding interleaved Reed-Solomon Codes with the decoder found by Bleichenbacher et al. (Ref.1) is upper bounded by O(1/q), independently of n. The decoding algorithm presented here is similar to that of standard RS codes. It involves computing the error-locator polynomial. These polynomials are found by computing the right kernel of the matrix. The correct solution is always in the right kernel, and so we can correctly decode if the right kernel is one-dimensional