2000 character limit reached
The Berlekamp-Massey Algorithm revisited
Published 21 Nov 2022 in cs.DS and math.AG | (2211.11721v3)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.