MA-581K/CSC-691K Homework 4 (due November 5 at 5pm)
Consider the sequence a0 = 1, a1 = 1,
a2 = 2,...,ai = binomial(i,[i/2]),...
of middle entries in the Pascal triangle.
Investigate how the Berlekamp/Massey algorithm attempts to compute
a linear generator for this sequence. In particular, can you
give explicit formulas for the Lambda and B polynomials and
the discrepancies Delta?