Berlekamp–Massey algorithm: Difference between revisions

Content deleted Content added
Code Sample in Java: removed some unnecessary code
lower case required by WP:MOS
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>.
 
==Code Samplesample in C#==
<source lang="csharp">
byte[] b, c, t, s;
Line 86:
</source>
 
==Code Samplesample in Java==
<source lang="java">
public int runTest(int[] array) {