Berlekamp–Massey algorithm

Article
Talk

This is an old revision of this page, as edited by DavidCary (talk | contribs) at 21:13, 12 June 2004 (ext link). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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

External links

http://www.paulisageek.com/school/ has some related papers
An online implementation: http://www.paulisageek.com/school/pmat519/berlekamp-massey.php

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