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

ZHAO Lu; WEN Qiao-yan

Paper 2008/259

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

ZHAO Lu and WEN Qiao-yan

Abstract

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 GF(2) by either inserting or deleting k symbols within one period. The results show the variation of the distribution of the 2-adic complexity becomes as k increases. Particularly, we discuss the lower bounds when k respectively.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Published elsewhere. Unknown where it was published
Contact author(s): zhaolu nan @ gmail com
History: 2008-06-10: received
Short URL: https://ia.cr/2008/259
License: CC BY

BibTeX

@misc{cryptoeprint:2008/259,
      author = {ZHAO Lu and WEN Qiao-yan},
      title = {2-Adic Complexity of a Sequence Obtained from a Periodic Binary Sequence by Either Inserting or Deleting  k Symbols within One Period},
      howpublished = {Cryptology ePrint Archive, Paper 2008/259},
      year = {2008},
      note = {\url{https://eprint.iacr.org/2008/259}},
      url = {https://eprint.iacr.org/2008/259}
}