Reeds–Sloane algorithm

The Reeds–Sloane algorithm, named after James Reeds and <a href="/facts/Neil_Sloane/kLWw29Me">Neil Sloane</a>, is an extension of the <a href="/facts/Berlekamp%25E2%2580%2593Massey_algorithm/cDwPPkk0">Berlekamp–Massey algorithm</a>, an algorithm for finding the shortest <a href="/facts/Linear-feedback_shift_register/22pktBbX">linear-feedback shift register</a> (LFSR) for a given output <a href="/facts/Sequence/gV2S4uqp">sequence</a>, for use on sequences that take their values from the <a href="/facts/Integers_mod_n/0wtRa5dU">integers mod n</a>.

<ul><li>Reeds, J. A.; N. J. A. Sloane (1985). <a href="http://neilsloane.com/doc/Me111.pdf">"Shift-Register Synthesis (Modulo m)"</a> (PDF). SIAM Journal on Computing. 14 (3): 505–513. <a href="/facts/CiteSeerX_(identifier)/SceDmd3c">CiteSeerX</a> <a href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.4652">10.1.1.48.4652</a>. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1137%2F0214038">10.1137/0214038</a>.</li></ul>

Reeds–Sloane algorithm open-in-new

Reeds–Sloane algorithm