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