Cryptology ePrint Archive: Report 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, 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.

Category / Keywords: foundations /

Date: received 4 Jun 2008

Contact author: zhaolu nan at gmail com

Available formats: PDF | BibTeX Citation

Version: 20080610:130310 (All versions of this report)

Discussion forum: Show discussion | Start new discussion