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 == Reeds, J. A.; N. J. A. Sloane (1985).
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 == Reeds, J. A.; N. J. A. Sloane (1985).
Source: Wikipedia "Reeds–Sloane algorithm" · CC BY-SA 4.0
Share this article: X · Bluesky