Efficient interpolation in the Guruswami-Sudan algorithm
IEEE Transactions on Information Theory
Hi-index | 0.06 |
We consider the problem of efficient implementation of two-dimensional interpolation in the Guruswami-Sudan list decoding algorithm for Reed-Solomon codes. We show that it can be implemented by computing the product of ideals of interpolation polynomials constructed for subsets of interpolation points. A method for fast multiplication of coprime zero-dimensional ideals is proposed.