Interpolation and approximation in decoding
Iwan Duursma · 2002
Recently Sudan (see J. Complexity, vol.13, no.1, p.180-93, 1997) formulated a decoding procedure for decoding Reed-Solomon codes beyond the packing radius. The potential of the method for algebraic-geometric codes was recognized by Shokrollahi and Wasserman. We discuss similarities and differences with some previous algebraic decoding procedures.