Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

AAECC
2006
Springer

favoriteEmaildiscussreport

133views Algorithms» more AAECC 2006»

The Berlekamp-Massey Algorithm revisited

13 years 4 months ago

The Berlekamp-Massey Algorithm revisited

Download hlombardi.free.fr

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. MSC 2000: 68W30, 15A03 Key words: Berlekamp-Massey Algorithm. Linearly recurrent sequences.

Nadia Ben Atti, Gema M. Diaz-Toca, Henri Lombardi

Real-time Traffic

AAECC 2006 | Algorithms | Berlekamp-Massey Algorithm | Recurrent Sequences | Slight Modification |

claim paper

Related Content

» Algebraic Decoding of Quadratic Residue Codes Using BerlekampMassey Algorithm

» Evaluation codes and plane valuations

» Fast Algebraic Attacks on Stream Ciphers with Linear Feedback

» On formulas for decoding binary cyclic codes

» Algebraic Attacks on SOBERt32 and SOBERt16 without Stuttering

» Improving the BonehFranklin Traitor Tracing Scheme

» FFCSR Design of a New Class of Stream Ciphers

» Automatic Reproduction of a Genius Algorithm Strassens Algorithm Revisited by Genetic Sear...

» SVD and Clustering for Unsupervised POS Tagging

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2006
Where	AAECC
Authors	Nadia Ben Atti, Gema M. Diaz-Toca, Henri Lombardi

Comments (0)