Revision as of 17:52, 4 September 2019 edit 146.54.156.15 (talk) +lnk ← Previous edit		Latest revision as of 20:17, 21 November 2021 edit undo Comp.arch (talk \| contribs) Extended confirmed users 41,494 edits mNo edit summary Tag: 2017 wikitext editor
Line 1: The '''Reeds–Sloane algorithm''', named after [[James Reeds]] and [[Neil Sloane]], 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\|integers mod ''n'']]. == References ==

Reeds–Sloane algorithm: Difference between revisions