Content deleted Content added
→References: Reeds Sloane pp 505-513 -- follow doi link or url link |
m Bot: Removing Orphan Tag (Nolonger an Orphan) (Report Errors) |
||
Line 1:
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'']].
|