Reeds–Sloane algorithm: Difference between revisions

Content deleted Content added
the correct name is "Reeds-Sloane" algorithm; see the original paper.
Addbot (talk | contribs)
m Bot: Adding Orphan Tag (Questions) (Report Errors)
Line 1:
{{Orphan|date=February 2009}}
{{cleanup-context}}
The '''Reeds-Sloane algorithm''' 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]].