Reeds–Sloane algorithm
The Reeds–Sloane algorithm, named after 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.
- Comment
- enThe Reeds–Sloane algorithm, named after 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.
- Has abstract
- enThe Reeds–Sloane algorithm, named after 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.
- Hypernym
- Extension
- Is primary topic of
- Reeds–Sloane algorithm
- Label
- enReeds–Sloane algorithm
- Link from a Wikipage to an external page
- neilsloane.com/doc/Me111.pdf
- mathworld.wolfram.com/Reeds-SloaneAlgorithm.html
- Link from a Wikipage to another Wikipage
- Berlekamp–Massey algorithm
- Category:Cryptanalytic algorithms
- Integers mod n
- James Reeds
- Linear-feedback shift register
- MathWorld
- Neil Sloane
- Sequence
- SameAs
- 4tpw4
- m.042pl7
- Q7306757
- Subject
- Category:Cryptanalytic algorithms
- WasDerivedFrom
- Reeds–Sloane algorithm?oldid=1056438748&ns=0
- WikiPageLength
- 926
- Wikipage page ID
- 1062262
- Wikipage revision ID
- 1056438748
- WikiPageUsesTemplate
- Template:Cite journal
- Template:Crypto-stub