Jump to content

Reeds–Sloane algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Danger (talk | contribs) at 05:41, 16 October 2008 (add clarifying text from Berlekamp-Massey algorithm). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Reed-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.