Berlekamp–Massey algorithm: Difference between revisions

Revision as of 20:05, 20 September 2009

Revision as of 22:52, 21 September 2009

Line 25:

int position = 0;

public BerlekampRegistryTester(int sequenceLenghtsequenceLength)

{

b = new byte[sequenceLenghtsequenceLength];

c = new byte[sequenceLenghtsequenceLength];

t = new byte[sequenceLenghtsequenceLength];

s = new byte[sequenceLenghtsequenceLength];

for (int i = 0; i < sequenceLenghtsequenceLength; i++)

{

b[i] = c[i] = t[i] = 0;