Simple proof of the continued fraction algorithm for decoding Reed-Solomon codes

It was shown recently that BCH and RS codes can be implemented by Berlekamp's algorithm using continued fraction approximations. A simple transparent proof of Berlekamp's algorithm that uses such a development is given in this paper.