The Berlekamp-Massey Algorithm revisited

Authors:
Nadia Ben Atti;Gema M. Diaz–Toca;Henri Lombardi
Affiliations:
Equipe de Mathématiques, CNRS UMR 6623, UFR des Sciences et Techniques, Université de Franche-Comté, 25 030, Besançon cedex, France;Dpto. de Matematicas Aplicada, Universidad de Murcia, 25 030, Besançon cedex, Spain;Equipe de Mathématiques, CNRS UMR 6623, UFR des Sciences et Techniques, Université de Franche-Comté, 25 030, Besançon cedex, France
Venue:
Applicable Algebra in Engineering, Communication and Computing
Year:
2006

Citing 0
Cited 2

A reconfigurable FEC system based on Reed-Solomon codec for DVB and 802.16 network

WSEAS Transactions on Circuits and Systems
On the resistance of Boolean functions against algebraic attacks using univariate polynomial representation

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

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.