Wikipedia

Berlekamp–Massey algorithm

This is an old revision of this page, as edited by Greenrd (talk | contribs) at 22:57, 30 April 2007 (stub sorted). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

 

This computer science 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 "https://en.wikipedia.org/w/index.php?title=Berlekamp–Massey_algorithm&oldid=127271274"