Reeds–Sloane algorithm: Difference between revisions

Revision as of 05:41, 5 October 2009

Revision as of 03:23, 17 December 2009

Line 1:

{{Context|date=October 2009}}

The '''Reeds-SloaneReeds–Sloane algorithm''' is an extension of the [[Berlekamp-MasseyBerlekamp–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|integers mod ''n'']].

== External links ==

* [http://mathworld.wolfram.com/Reed-SloaneAlgorithm.html Reed-SloaneReed–Sloane Algorithm] on [[MathWorld]]

== References ==

Line 14:

| volume = 14

| issue = 3

| pages = 505-517505–517

| date = 1985

| url = http://www.research.att.com/~njas/doc/1218shift.pdf