Berlekamp–Massey algorithm: Difference between revisions

Revision as of 14:40, 21 December 2009

Revision as of 09:58, 2 January 2010

Line 115:

return l;

}

</source>

==Code sample in Python==

<source lang="python">

def BerlekampMassey(sequence) :

length = len(sequence)

b, c, t = [0]*length, [0]*length, [0]*length

b[0], c[0] = 1, 1

l, m = 0, -1

for n in range(length):

d, i = 0, 0

while i <= l :

d = d ^ (c[i] * sequence[n - i])

i+=1

if d == 1 :

t = c[:]

j = 0

for j in range(length - n + m - 1) :

c[n - m + j] = c[n - m + j] ^ b[j]

if (l <= n / 2) :

l = n + 1 - l

m = n

b = t[:]

return l, c

</source>