Berlekamp Massey Algorithm
Program to find the minimal polynomial of a linearly recurring sequence via BKM Algorithm.
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
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).
Cite As
Krishna Prasad (2026). Berlekamp Massey Algorithm (https://uk.mathworks.com/matlabcentral/fileexchange/23546-berlekamp-massey-algorithm), MATLAB Central File Exchange. Retrieved .
General Information
- Version 1.3.0.0 (2.16 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
