Introduction - If you have any usage issues, please Google them yourself
VC++ programming domain of the dual BM algorithm. Berlekamp-Massey algorithm is a rare efficient algorithm. Just type of dense text 2l bits, we can have the minimal polynomial LFSR, resulting in the formation of the entire sequence. Here l is the linear complexity.
Packet : 49636975b_m算法.rar filelist
B_M算法\B_M\B_M.rc
B_M算法\B_M\B_MDlg.h
B_M算法\B_M\B_M.dsp
B_M算法\B_M\B_M.opt
B_M算法\B_M\B_M.clw
B_M算法\B_M\ReadMe.txt
B_M算法\B_M\B_M.h
B_M算法\B_M\B_MDlg.cpp
B_M算法\B_M\B_M.APS
B_M算法\B_M\StdAfx.h
B_M算法\B_M\StdAfx.cpp
B_M算法\B_M\B_M.dsw
B_M算法\B_M\B_M.ncb
B_M算法\B_M\Resource.h
B_M算法\B_M\B_M.plg
B_M算法\B_M\sq.h
B_M算法\B_M\B_M.cpp
B_M算法\B_M\Debug
B_M算法\B_M\res\B_M.rc2
B_M算法\B_M\res\B_M.ico
B_M算法\B_M\res\Thumbs.db
B_M算法\B_M\res
B_M算法\B_M
B_M算法