Berlekamp–Massey algorithm: Difference between revisions

Revision as of 20:01, 20 September 2009

Revision as of 20:05, 20 September 2009

Line 19:

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

==Code Sample in C#==

<source lang="csharp">

byte[] b, c, t, s;