A fast algorithm for determining k-error linear complexity profile of a binary sequence with period P~n
Xiao Guo-zhen · Journal of China Institute of Communications · 2004
A fast algorithm was presented for determining k-error linear complexity profile of a binary sequence with period Pn, where p is a prime and 2 is a primitive root modulo P2.The algorithm generalizes both the WEI-BAI-XIAO and WEI-DONG-XIAO algorithms, which compute the linear complexity and k-error linear complexity of a binary sequence of period Pn, respectively.