Berlekamp–Massey algorithm: Difference between revisions

Content deleted Content added
Added two references and a references section
Code Sample in Java: removed some unnecessary code
Line 94:
b[0] = 1;
c[0] = 1;
int n = 0;
int l = 0;
int m = -1;
for (int n = 0; n < array.length; n++) {
int d = 0;
for (int i = 0; i <= l; i++) {