Berlekamp Massey Algorithm

バージョン 1.3.0.0 (2.16 KB) 作成者: Krishna Prasad
Program to find the minimal polynomial of a linearly recurring sequence via BKM Algorithm.
3.0
(1)
ダウンロード: 2K
更新 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. 取得済み .

MATLAB リリースの互換性
作成: R14
すべてのリリースと互換性あり
プラットフォームの互換性
Windows macOS Linux
カテゴリ
Help Center および MATLAB Answers で Graph and Network Algorithms についてさらに検索

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

バージョン 公開済み リリース ノート
1.3.0.0

There are title changes in the program for better output.
1.0.0.0