تقرير
The Berlekamp-Massey Algorithm revisited
| العنوان: | The Berlekamp-Massey Algorithm revisited |
|---|---|
| المؤلفون: | Atti, Nadia Ben, Diaz--Toca, Gema M., Lombardi, Henri |
| المصدر: | AAECC 17 (1) (2006), 75--82 |
| سنة النشر: | 2022 |
| المجموعة: | Computer Science Mathematics |
| مصطلحات موضوعية: | Computer Science - Data Structures and Algorithms, Mathematics - 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. Comment: in English and French versions |
| نوع الوثيقة: | Working Paper |
| اللغة: | English |
| DOI: | 10.1007/s00200-005-0190-z |
| URL الوصول: | http://arxiv.org/abs/2211.11721 |
| رقم الأكسشن: | edsarx.2211.11721 |
| قاعدة البيانات: | arXiv |
| DOI: | 10.1007/s00200-005-0190-z |
|---|