Berlekamp Massey Algorithm

版本 1.3.0.0 (2.2 KB) 作者: Krishna Prasad

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

关注

3.0

(1)

2.0K 次下载

更新时间 2009/5/24

查看许可证

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

引用格式

Krishna Prasad (2024). Berlekamp Massey Algorithm (https://www.mathworks.com/matlabcentral/fileexchange/23546-berlekamp-massey-algorithm), MATLAB Central File Exchange. 检索来源 2024/7/26.