W. E. N. Qiao-yan

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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(More)
  • 1