The Berlekamp-Massey Algorithm revisited
Data Structures and Algorithms
2025-02-18 v3 Algebraic Geometry
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.
Cite
@article{arxiv.2211.11721,
title = {The Berlekamp-Massey Algorithm revisited},
author = {Nadia Ben Atti and Gema M. Diaz--Toca and Henri Lombardi},
journal= {arXiv preprint arXiv:2211.11721},
year = {2025}
}
Comments
in English and French versions