2009/08/15 by Maria Bras-Amorós, Bras-Amorós, Maria, Michael E. O’Sullivan +2
Computer Science · Engineering · Mathematics · #Advanced Combinatorial Mathematics #Coding theory and cryptography #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.DM #cs.IT #graph theory and CDMA systems #math.IT
paper · pdf · doi:10.48550/arxiv.0908.2198
arxiv created 2009/08/15 · openalex publication_date 2009/08/15 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/30
The two primary decoding algorithms for Reed-Solomon codes are the Berlekamp-Massey algorithm and the Sugiyama et al. adaptation of the Euclidean algorithm, both designed to solve a key equation. In this article an alternative version of the key equation and a new way to use the Euclidean algorithm to solve it are presented, which yield the Berlekamp-Massey algorithm. This results in a new, simpler, and compacter presentation of the Berlekamp-Massey algorithm.