Berlekamp-Massey algorithm

From Wikipedia, the free encyclopedia

You have new messages (last change).

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 James Massey the following year. It became the key to practical application of the now ubiquitous Reed-Solomon code.

[edit] External links

 This computer-related article is a stub. You can help Wikipedia by expanding it.
 This mathematics-related article is a stub. You can help Wikipedia by expanding it.
 This cryptography-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../b/e/r/Berlekamp-Massey_algorithm_a3c1.html"
In other languages