Reeds–Sloane algorithm

Uses your system voice; voice and rate in settings.

Snapshot

≈ 1 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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.

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.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1056438748 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001056438748 · captured 1637522275.0 · version history

Cite this page as: encyclopegia.org, “Reeds–Sloane algorithm”, snapshot enwiki-001056438748. https://encyclopegia.org/a/reeds-sloane-algorithm

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.