Revision as of 18:02, 16 October 2008 edit Zvika (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 4,940 edits m moved Reed-Sloane algorithm to Reeds-Sloane algorithm: incorrect name; see authors of paper ← Previous edit		Revision as of 18:03, 16 October 2008 edit undo Zvika (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 4,940 edits the correct name is "Reeds-Sloane" algorithm; see the original paper. Next edit →
Line 1: {{cleanup-context}} The '''~~Reed~~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]]. == External links ==

Reeds–Sloane algorithm: Difference between revisions