2-adic complexity of binary sequences with period 2~mp~n
QI Wen-feng · Journal of China Institute of Communications · 2005
The 2-adic complexity of a sequence had been taken an important standard to judge whether a sequence was safe or not, because of rational approximation algorithm. Focusing on the analysis of binary sequences with period 2mpn, provided an anolog of the extended Games-Chan algorithm. And furthermore, a tight upper bound for the 2-adic complexity is determined.