You are looking at a specific version 20080610:130310 of this paper.
See the latest version.
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, 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)
- 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