Reeds–Sloane algorithm
 | This article provides insufficient context for those unfamiliar with the subject. (October 2009) |
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.
External links
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)
 | This cryptography-related article is a stub. You can help Wikipedia by expanding it. |