Berlekamp-Massey algorithm
From Wikipedia, the free encyclopedia
The Berlekamp-Massey algorithm is an algorithm for finding the shortest linear feedback shift register (LFSR) for a given output sequence. Equivalently, it is an algorithm for finding the minimal polynomial of a linearly recurrent sequence.
The algorithm was invented by Elwyn Berlekamp in 1968. Its connection to linear codes was observed by J. L. Massey the following year. It became the key to practical application of the now ubiquitous Reed-Solomon code.
[edit] External links
- Berlekamp-Massey algorithm at PlanetMath.
- Berlekamp-Massey algorithm at MathWorld
- An online implementation
- Implementation in Mathematica
 |
This cryptography-related article is a stub. You can help Wikipedia by expanding it. |
