VC＋＋编程实现了二元域的BM算法。Berlekamp-Massey 算法是一个少有的高效算法。只需要输入密文中的2l个比特，就可以产生LFSR的最小多项式，从而生成整个序列。这里的l是系统的线性复杂度。-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. 下载
|
VC＋＋编程实现了二元域的BM算法。Berlekamp-Massey 算法是一个少有的高效算法。只需要输入密文中的2l个比特，就可以产生LFSR的最小多项式，从而生成整个序列。这里的l是系统的线性复杂度-VC + + programming domain of the binary BM algorithm. Berlekamp-Massey algorithm is a rare efficient algorithm. Only need to import ciphertext of 2 l bits, we can have the minimal polynomial LFSR, resulting in the formation of the entire sequence. L here is the system of linear complexity 下载
|
一个用c编的RS编码的程序，采用BERLEKAMP-MASSEY S 算法，输入m,以及信噪比，可得到生成多项式和误码率等。-with a series of RS coding procedures, using BERLEKAMP - MASSEY S algorithm input m, and the signal-to-noise ratio. available generating polynomial and the error rate. 下载
|