Reeds–Sloane algorithm

From Wikipedia, the free encyclopedia
Revision as of 20:17, 21 November 2021 by imported>Comp.arch
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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

  • Script error: No such module "Citation/CS1".

External links

Template:Asbox