  We propose a new algorithm for decoding Reed-Solomon codes (up to half the
minimum distance) and for computing inverses in $F[x]/m(x)$. The proposed
algorithm is similar in spirit and structure to the Berlekamp-Massey algorithm,
but it works naturally for general $m(x)$.
