Revision as of 19:43, 11 September 2008 edit CRGreathouse (talk \| contribs) Autopatrolled, Administrators 13,002 edits m templetize ← Previous edit		Revision as of 09:57, 20 February 2009 edit undo Zvika (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 4,940 edits →External links Next edit →
Line 18: At the end of the algorithm, <math>L</math> is the length of the minimal LFSR for the stream, and we have <math>c_Ls_a + c_{L-1}s_{a+1} + c_{L-2}s_{a+2} ... = 0</math> for all <math>a</math>. ==See also== * [[Reeds-Sloane algorithm]], an extension for sequences over integers mod ''n'' ==External links==

Berlekamp–Massey algorithm: Difference between revisions