Wikipedia

Berlekamp–Massey algorithm

This is an old revision of this page, as edited by Matt Crypto (talk | contribs) at 20:10, 6 December 2004 (fmt). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Berlekamp-Massey algorithm is a algorithm for finding the shortest linear feedback shift register (LFSR) for a given output sequence.


This 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=10900926"