Code covered by the BSD License  

Highlights from
Berlekamp Massey Algorithm

3.0

3.0 | 1 rating Rate this file 23 Downloads (last 30 days) File Size: 2.16 KB File ID: #23546

Berlekamp Massey Algorithm

by

 

03 Apr 2009 (Updated )

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

| Watch this File

File Information
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)
Tags for This File   Please login to tag files.
Please login to add a comment or rating.
Comments and Ratings (1)
27 May 2009 Krishna Prasad  
Updates
24 May 2009

There are title changes in the program for better output.

Contact us