Revision as of 22:15, 24 February 2007 edit 75.33.70.131 (talk) No edit summary ← Previous edit		Revision as of 22:45, 24 February 2007 edit undo Ntsimp (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers 34,638 edits wikilink James Massey Next edit →
Line 1: 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 [[Recurrence relation\|linearly recurrent sequence]]. The algorithm was invented by [[Elwyn Berlekamp]] in 1968. Its connection to linear codes was observed by [[~~J. L.~~James Massey]] the following year. It became the key to practical application of the now ubiquitous [[Reed-Solomon error correction\|Reed-Solomon code]]. ==External links==

Berlekamp–Massey algorithm: Difference between revisions