Paper Info
Title
The Berlekamp-Massey Algorithm and the Euclidean Algorithm: a Closer Link
Abstract
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.
Year
Venue
Keywords
2009
Clinical Orthopaedics and Related Research
information theory,discrete mathematics,reed solomon code,euclidean algorithm
Field
DocType
Volume
Cantor–Zassenhaus algorithm,Discrete mathematics,Ramer–Douglas–Peucker algorithm,Berlekamp–Welch algorithm,Berlekamp's algorithm,Extended Euclidean algorithm,Algorithm,Binary GCD algorithm,Berlekamp–Massey algorithm,Mathematics,Difference-map algorithm
Journal
abs/0908.2
Citations 
PageRank 
References 
1
0.35
4
Authors
2
Name
Order
Citations
PageRank
Maria Bras-Amoros114719.96
Michael E. O'Sullivan2889.65