CryptoDB
2-Adic Complexity of a Sequence Obtained from a Periodic Binary Sequence by Either Inserting or Deleting k Symbols within One Period
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2008-17936, title={2-Adic Complexity of a Sequence Obtained from a Periodic Binary Sequence by Either Inserting or Deleting k Symbols within One Period}, booktitle={IACR Eprint archive}, keywords={foundations /}, url={http://eprint.iacr.org/2008/259}, note={ zhaolu.nan@gmail.com 14035 received 4 Jun 2008}, author={ZHAO Lu and WEN Qiao-yan}, year=2008 }