On the equivalence of two Welch-Berlekamp key equations and their error evaluators
We present two lemmas relating polynomials occurring in the derivations of the Welch-Berlekamp (WB) key equation for Reed-Solomon codes. The lemma provides the connection between the conventional Welch-Berlekamp form of the key equation and the nullspace-based derivation of Dabiri and Blake. The second lemma allows the error values for the Dabiri Blake formulation to be computed based on the error values for the Welch-Berlekamp form.
welch-berlekamp key equation reed-solomon decoding (wb) algorithm