Fitzpatrick's algorithm for solving the classical Reed-Solomon key equ
ation is shown to be related to an algorithm for solving the Welch-Ber
lekamp key equation. It can be made more efficient when decoding binar
y BCH codes. Its efficiency is about the same as for the Berlekamp-Mas
sey algorithm.