Wikipedia

Berlekamp–Massey algorithm

This is an old revision of this page, as edited by Remuel (talk | contribs) at 17:43, 8 March 2005 (sorted stub). 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.


 

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=16354955"