The Berlekamp-Massey Algorithm revisited
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2022
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910828920307712 |
|---|---|
| author | Atti, Nadia Ben Diaz--Toca, Gema M. Lombardi, Henri |
| author_facet | Atti, Nadia Ben Diaz--Toca, Gema M. Lombardi, Henri |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2211_11721 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | The Berlekamp-Massey Algorithm revisited Atti, Nadia Ben Diaz--Toca, Gema M. Lombardi, Henri Data Structures and Algorithms Algebraic Geometry 68W30, 15A03 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. |
| title | The Berlekamp-Massey Algorithm revisited |
| topic | Data Structures and Algorithms Algebraic Geometry 68W30, 15A03 |
| url | https://arxiv.org/abs/2211.11721 |