On the Performance of Multivariate Interpolation Decoding of Reed-Solomon Codes

The multivariate interpolation decoding (MID) algorithm for certain Reed-Solomon codes was recently introduced by Parvaresh and Vardy. The MID algorithm attempts to list-decode up to ntau
_MID
= n (1 -R
^M
(M+1)/) errors, in a Reed-Solomon code of length n and rate R, using (M+1)-variate polynomial interpolation. This improves on the Guruswami-Sudan decoding radius of tau
_GS
= 1 - radicR by a large margin, especially for high-rate codes. The problem is that successful decoding is not guaranteed: there are certain patterns of less than ntau
_MID
errors which the MID algorithm fails to decode. Nevertheless, simulations show that the actual performance of the MID decoder is very close to what one would expect if all patterns of up to ntau
_MID
errors were corrected. On the other hand, analysis of the failure probability for the MID algorithm is extremely difficult, and there were no analytic results so far to confirm this empirically observed behavior. In this work, we provide such analytic results: we present a detailed analysis of the probability of failure in the MID algorithm for the special case where M = 2 and the interpolation multiplicity is m = 1. In this case, the MID algorithm attempts to correct up to ntau
_2,1
errors, where tau
_2,1
= 1 -
³
radic6R
²
. We consider the situation where symbol values received from the channel at the erroneous positions are distributed uniformly at random (a version of the q-ary symmetric channel). We show that, with high probability, the performance of the MID algorithm is very close to the optimum in this case. Specifically, we prove that if the fraction of positions in error is at most tau
_2,1
-O(R
^5/3
), then the probability of failure in the MID algorithm is at most n
^-Omega(n)
. Thus the probability of failure is, indeed, negligible for large n in this case