Description: 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 consisting of the first N terms of sn. Returned value (L) is the length of the shortest linear feedback shift register sequence that generates all bits in sequence sn.
File list (Check if you may need any files):
BM.txt
Download