First we provide an analog of the extended Games-Chan algorithm which can yield a tight upper bound for the 2-adic complexity of periodic binary sequences with period 2~mp~n.

• 首先给出了类似的扩展Games-Chan算法,利用这一算法,可以确定周期为2~mp~n的二元序列的2-adic复杂度的一个有效上界。