Reeds–Sloane algorithm: Difference between revisions

Content deleted Content added
I don't think it gives insufficient context, since the word "algorithm" is universally understood.
SmackBot (talk | contribs)
m Date maintenance tags and general fixes
Line 1:
{{Orphan|date=December 2009}}
{{orphan}}
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|integers mod ''n'']].