Jump to content

Reeds–Sloane algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Inkling (talk | contribs) at 22:25, 12 October 2004. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The Reed-Sloane algorithm is an extension of the Berlekamp-Massey algorithm for use on sequences that take their values from the integers mod n.