Revision as of 19:08, 19 February 2009 edit Addbot (talk \| contribs) Bots 2,838,809 edits m Bot: Adding Orphan Tag (Questions) (Report Errors) ← Previous edit		Revision as of 10:11, 20 February 2009 edit undo Zvika (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 4,940 edits added link to this page from Berlekamp-Massey algorithm, so {{orphan}} can be removed Next edit →
Line 1: ~~{{Orphan\|date=February 2009}}~~ {{cleanup-context}} The '''Reeds-Sloane algorithm''' is an extension of the [[Berlekamp-Massey algorithm]], an algorithm for finding the shortest [[linear feedback shift register]] (LFSR) for a given output sequence, for use on sequences that take their values from the [[integers mod n]].

Reeds–Sloane algorithm: Difference between revisions