论文信息 - 2-Adic Complexity of a Sequence Obtained from a Periodic Binary Sequence by Either Inserting or Deleting k Symbols within One Period

2-Adic Complexity of a Sequence Obtained from a Periodic Binary Sequence by Either Inserting or Deleting k Symbols within One Period

In this paper, we propose a method to get the lower bounds of the 2-adic complexity of a sequence obtained from a periodic sequence over by either inserting or deleting symbols within one period. The results show the variation of the distribution of the 2-adic complexity becomes as increases. Particularly, we discuss the lower bounds when respectively. k (2) GF

Lu Zhao | Qiao-yan Wen

[1] QI Wen-feng. 2-adic complexity of binary sequences with period 2~mp~n , 2005 .

[2] Shaoquan Jiang,et al. Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting kappa; symbols within one period , 2000, IEEE Trans. Inf. Theory.

[3] Dengguo Feng,et al. On the 2-Adic Complexity and the k-Error 2-Adic Complexity of Periodic Binary Sequences , 2004, SETA.

[4] Pla Foreign,et al. On stability of 2-adic complexity of periodic sequence , 2000 .

[5] Mark Goresky,et al. Feedback shift registers, 2-adic span, and combiners with memory , 1997, Journal of Cryptology.