Reeds–Sloane algorithm
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)". SIAM Journal on Computing 14 (3): 505–513. doi:10.1137/0214038.