BibTeX
@MISC{Atti_theberlekamp-massey,
author = {Nadia Ben Atti},
title = {The Berlekamp-Massey Algorithm revisited},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We propose a slight modification of the Berlekamp-Massey Algorithm for obtaining the minimal polynomial of a given linearly recurrent sequence. Such a modification enables to explain it in a simpler way and to adapt it to lazy evaluation.
Citations
| 351 | Algebraic Coding Theory - Berlekamp - 1968 |
| 216 | Shift-register synthesis and BCH decoding - Massey - 1969 |
| 83 | A computational introduction to number theory and algebra. Cambridge Univ Pr - Shoup - 2009 |
| 20 | On the equivalence between Berlekamp’s and Euclid’s algorithms - Dornstetter - 1987 |
| 14 | Continued fractions and Berlekamp’s algorithm - Welch - 1979 |
| 13 | Continued fractions and linear recurrences - Mills - 1975 |
| 7 | A simple Hankel interpretation of the Berlekamp -- Massey algorithm - Jonckheere, Ma - 1989 |
| 7 | New techniques for the computation of linear recurrence coefficients. Finite Fields and their - Pan - 2000 |
| 6 | On the continued fraction and Berlekamp’s algorithm - Cheng - 1984 |
| 1 | et al. A method for solving key equation for decoding Goppa codes - Sugiyama - 1975 |
