The error locator polynomial for correctable (t + 1)-error of RS codes
Masami Mohri, Masakatu Morii · 2008
The t-error-correcting Reed-Solomon (RS) code can detect more than t errors with high probability. Welch-Berlekamp (WB) algorithm is known as a decoding algorithm for RS codes, and it can solved the remainder key-equation. We have shown the condition for detecting the (t +mu )-error of RS code by WB algorithm. In this paper, we show a error locator polynomial for correctable (t + 1)-error of RS codes.