Incomplete locator polynomials and redundant iterations reduction in the Welch–Berlekamp algorithm
Dajun Xin · IEE Proceedings - Communications · 1998
A concept named ‘incomplete locator polynomial’ is introduced as a replacement for the traditional approach. Theorems for finding the incomplete locators were established when the Welch–Berlekamp algorithm was employed for decoding Reed–Solomon codes, and an incomplete iteration strategy of decoding Reed–Solomon codes, based on finding incomplete locator polynomials is presented, by which the redundant iterations in the Welch–Berlekamp algorithm are reduced significantly.