Berlekamp Massey Algorithm

Versión 1.3.0.0 (2,16 KB) por Krishna Prasad
Program to find the minimal polynomial of a linearly recurring sequence via BKM Algorithm.
3.0
(1)
2K descargas
Actualizado 24 may 2009

Ver licencia

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

Citar como

Krishna Prasad (2024). Berlekamp Massey Algorithm (https://www.mathworks.com/matlabcentral/fileexchange/23546-berlekamp-massey-algorithm), MATLAB Central File Exchange. Recuperado .

Compatibilidad con la versión de MATLAB
Se creó con R14
Compatible con cualquier versión
Compatibilidad con las plataformas
Windows macOS Linux
Categorías
Más información sobre Graph and Network Algorithms en Help Center y MATLAB Answers.

Community Treasure Hunt

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

Start Hunting!

Versión Publicado Notas de la versión
1.3.0.0

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