File Exchange

image thumbnail

Berlekamp Massey Algorithm

version 1.3 (2.16 KB) by

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

6 Downloads

Updated

View License

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).

Comments and Ratings (1)

Krishna Prasad

Krishna Prasad (view profile)

Updates

1.3

There are title changes in the program for better output.

MATLAB Release
MATLAB 7 (R14)

Download apps, toolboxes, and other File Exchange content using Add-On Explorer in MATLAB.

» Watch video