Reeds–Sloane algorithm: Difference between revisions

Content deleted Content added

Revision as of 09:10, 19 February 2019 edit Citation bot (talk \| contribs) Bots 5,868,077 edits m Add: citeseerx. \| You can use this bot yourself. Report bugs here. \| User-activated. ← 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
(2 intermediate revisions by 2 users 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 18: == External links == * [http://mathworld.wolfram.com/~~Reed~~Reeds-SloaneAlgorithm.html ~~Reed–Sloane~~Reeds–Sloane Algorithm] on [[MathWorld]] {{DEFAULTSORT:Reeds-Sloane algorithm}} [[Category:Cryptanalytic algorithms]] {{crypto-stub}}