Reeds–Sloane algorithm: Difference between revisions

Revision as of 21:16, 22 December 2009

Revision as of 18:05, 23 December 2009

Line 1:

{{Orphan|date=December 2009}}

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|integers mod ''n'']].

== References ==