Jump to content

Reeds–Sloane algorithm

From Wikipedia, the free encyclopedia

The Reeds–Sloane algorithm, named after James Reeds and Neil 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

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