Content deleted Content added
add clarifying text from Berlekamp-Massey algorithm |
add external link and reference |
||
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]].
== External links ==
* [http://mathworld.wolfram.com/Reed-SloaneAlgorithm.html Reed-Sloane Algorithm] on [[MathWorld]]
== References ==
* {{cite journal
| last = Reeds
| first = J. A.
| coauthors = N. J. A. Sloane
| title = Shift-Register Sequences (Modulo ''m'')
| journal = SIAM Journal on Computing
| volume = 14
| issue = 3
| pages = 505-517
| date = 1985
| url = http://www.research.att.com/~njas/doc/1218shift.pdf
| doi = 10.1137/0214038
}}
| |||