Revision as of 03:21, 23 March 2004 edit Frencheigh (talk \| contribs) 2,932 edits mNo edit summary ← Previous edit		Revision as of 00:50, 26 May 2004 edit undo Docu (talk \| contribs) 97,802 edits m fmt Next edit →
Line 1: AThe ~~[http://www.paulisageek.com/school/berlekamp~~'''Berlekamp-~~massey.php~~Massey ~~page]~~algorithm''' ~~ilustrating~~is ~~the Berlekamp-Massey~~a [[algorithm]] for finding the shortest [[linear feedback shift register]] ([[LFSR]]) for a given output sequence. ==External links== *http://www.paulisageek.com/school/berlekamp-massey.php {{msg:stub}}

Berlekamp–Massey algorithm: Difference between revisions