Stability of Joint 2-adic Complexity of Multi-periodic Sequence
现多重周期序列联合2-adic复杂度的稳定性

In this paper, the definition of joint k-error 2-adic complexity is first proposed, as well as joint k-error 2-adic complexity is used to measure the stability of 2-adic complexity of periodic multisequences. Then some enumeration results are derived for two kinds of joint error 2-adic complexity and the lower bounds are presented for their expected values of m-fold multisequences of period N, which 2N-1=p,p1p2, respectively. Furthermore, it is showed that the formula 2N-1=pe(e>1), has no solution. The results are important for studying the stability of joint 2-adic complexity of multisequences.