Reed–Solomon codes are employed in a wide range of applications. If they are used in a
portable version of a communication system, then the size and dissipation of the VLSI
decoding chip are important, as well as the speed of the embodied algorithm. In this paper
we compare the performance of the extended Euclidean algorithm and Fitzpatrick's
algorithm with reference to these criteria.