The Berlekamp-Massey Algorithm revisited

TL;DR

This paper presents a simplified modification of the Berlekamp-Massey Algorithm, enhancing its explanation and enabling adaptation to lazy evaluation for computing minimal polynomials of linearly recurrent sequences.

Contribution

It introduces a slight modification to the classical algorithm, making it easier to understand and adaptable to lazy evaluation techniques.

Findings

Simplified explanation of the Berlekamp-Massey Algorithm

Modified algorithm supports lazy evaluation

Enhanced understanding of minimal polynomial computation

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.