Skip to Main Content
The interpolation step of the Wu list decoding algorithm for Reed–Solomon codes is considered. The problem is reformulated as construction of a partially homogenized interpolation polynomial. A generalization of the binary interpolation algorithm, which is based on the novel formulation of the interpolation step, is provided. It enables complexity reduction both with respect to the Wu method based on the iterative interpolation algorithm, as well as the Guruswami–Sudan method based on re-encoding and the binary interpolation algorithm.