Revision as of 03:23, 20 September 2005 edit 4pq1injbok (talk \| contribs) Extended confirmed users 2,879 edits replace link ← Previous edit		Revision as of 23:44, 20 September 2005 edit undo Curpsbot-unicodify (talk \| contribs) 29,655 edits m 1 link(s): [_ ]+ → [ ] 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. Massey]] the following year. It became the key to practical application of the now ubiquitous [[Reed-Solomon error correction\|Reed-Solomon code]].

Berlekamp–Massey algorithm: Difference between revisions