The Berlekamp-Massey Algorithm revisited
arXiv:2211.11721 · doi:10.1007/s00200-005-0190-z
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.
in English and French versions