Berlekamp Massey Algorithm

Program to find the minimal polynomial of a linearly recurring sequence via BKM Algorithm.

Description

For finding the minimal polynomial of a linearly recurring sequence s, we need to enter expected degree bound of minimal polynomial and at least first twice(of degree bound) terms of the sequence. e.g:
N=4
s=[0 1 1 2 3 5 8 13]
For this minimal polynomial is [1 -1 -1].
This minimal polynomial is in from higher degree to lower degree(stranded form as in matlab).

• MATLAB release: MATLAB 7 (R14)

[Krishna Prasad]