Reeds–Sloane algorithm: Difference between revisions

Content deleted Content added

Revision as of 20:26, 2 September 2019 edit Gfis (talk \| contribs) 176 edits m Name and links with "s" ← 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
(One intermediate revision by one other user not shown)
Line 1: The '''Reeds–Sloane algorithm''', named after ~~J. A.~~[[James Reeds]] and [[~~N. J. A.~~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 == Line 22: {{DEFAULTSORT:Reeds-Sloane algorithm}} [[Category:Cryptanalytic algorithms]] {{crypto-stub}}