|
|||||
|
|
The Berlekamp-Massey Algorithm revisited |
|
| Authors: | Nadia Ben Atti Gema M Diaz–Toca Henri Lombardi |
| Affiliation: | 1. Equipe de Mathématiques, CNRS UMR 6623, UFR des Sciences et Techniques, Université de Franche-Comté, 25 030, Besan?on cedex, France 2. Dpto. de Matematicas Aplicada, Universidad de Murcia, Spain |
| 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. partially supported by the Galois Theory and Explicit Methods in Arithmetic Project HPRN-CT-2000-00114 partially supported by the European Union funded project RAAG CT-2001-00271 |
| Keywords: | 68W30 15A03 |
| 本文献已被 SpringerLink 等数据库收录！ | |
