Reeds–Sloane algorithm: Difference between revisions

Revision as of 21:16, 22 December 2009

Latest revision as of 20:17, 21 November 2021

(20 intermediate revisions by 12 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'']].

{{Orphan|date=December 2009}}

The '''Reeds–Sloane algorithm,''' named after J. A. Reeds and [[N. J. A. 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 6 ⟶ 5:

| last = Reeds

| first = J. A.

| coauthors author2= N. J. A. Sloane

| title = Shift-Register SequencesSynthesis (Modulo ''m'')

| journal = SIAM Journal on Computing

| volume = 14

| issue = 3

| pages = 505–517505–513

| dateyear = 1985

| url = http://www.research.attneilsloane.com/~njas/doc/1218shiftMe111.pdf

| doi = 10.1137/0214038

| citeseerx = 10.1.1.48.4652

}}

== External links ==

* [http://mathworld.wolfram.com/ReedReeds-SloaneAlgorithm.html Reed–SloaneReeds–Sloane Algorithm] on [[MathWorld]]

{{DEFAULTSORT:Reeds-Sloane algorithm}}

[[Category:Cryptanalytic algorithms]]