The Berlekamp-Massey algorithm is an efficient algorithm for determining the linear complexity of a finite binary sequence sn of length n. The algorithm takes n iterations, with the Nth iteration computing the linear complexity of the subsequence sN

BCH码编码译码方法研究及仿真，主要有n-k编码、代数编码、彼得森译码、BM译码、群变换译码等，用MATLAB仿真。-BCH codes encoding&decoding methods and simulation