Wikipedia

Reeds–Sloane algorithm

This is an old revision of this page, as edited by 213.205.251.152 (talk) at 12:18, 20 October 2014 (Found a copy of the paper on the author's site. Replaced 3rd party link.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

References

  • Reeds, J. A.; N. J. A. Sloane (1985). "Shift-Register Sequences (Modulo m)" (PDF). SIAM Journal on Computing. 14 (3): 505–513. doi:10.1137/0214038.


 

This cryptography-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Reeds–Sloane_algorithm&oldid=630366287"