The Symmetric Key Equation for Reed–Solomon Codes and a New Perspective on the Berlekamp–Massey Algorithm

Abstract

This paper presents a new way to view the key equation for decoding Reed−Solomon codes that unites the two algorithms used in solving it—the Berlekamp−Massey algorithm and the Euclidean algorithm. A new key equation for Reed−Solomon codes is derived for simultaneous errors and erasures decoding using the symmetry between polynomials and their reciprocals as well as the symmetries between dual and primal codes. The new key equation is simpler since it involves only degree bounds rather than modular computations. We show how to solve it using the Euclidean algorithm. We then show that by reorganizing the Euclidean algorithm applied to the new key equation we obtain the Berlekamp−Massey algorithm.

Keywords

• reed–solomon codes
• key equation
• berlekamp–massey algorithm
• sugiyama et al. algorithm
• euclidean algorithm