Revision as of 10:29, 21 May 2005 edit RussBlau (talk \| contribs) 7,732 edits m sort stub ← Previous edit		Revision as of 05:41, 16 October 2008 edit undo Danger (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 33,221 edits add clarifying text from Berlekamp-Massey algorithm Next edit →
Line 1: {{cleanup-context}} The '''Reed-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