Berlekamp–Massey algorithm: Difference between revisions

Content deleted Content added
Correct link, add postcondition
Line 24:
At the end of the algorithm, L is the length of the minimal LFSR for the stream, and we have c[L]s[a] + c[L-1]s[a+1] + c[L-2]s[a+2] ... = 0 for all a.
 
 
==How does it work?==
 
==External links==