The Berlekamp-Massey Algorithm revisited

DOI10.1007/S00200-005-0190-ZMaRDI QIDQ6418021arXivFDO

Authors Nadia Ben Atti, Gema Maria Diaz Toca, Henri Lombardi

Publication date 21 November 2022

Published in arXiv

Full work available at URL https://doi.org/10.1007/S00200-005-0190-Z

Mathematics Subject Classification ID

Recurrences (11B37) Number-theoretic algorithms; complexity (11Y16) Symbolic computation and algebraic computation (68W30)

arXiv classification

cs.DSmath.AG

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.

This page was built for publication: The Berlekamp-Massey Algorithm revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6418021)