Jump to content

Reeds–Sloane algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Zvika (talk | contribs) at 18:03, 16 October 2008 (the correct name is "Reeds-Sloane" algorithm; see the original paper.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Reeds-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.

References

  • Reeds, J. A. (1985). "Shift-Register Sequences (Modulo m)" (PDF). SIAM Journal on Computing. 14 (3): 505–517. doi:10.1137/0214038. {{cite journal}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)


Stub icon

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=245713219"