On the 2-adic complexity and the κ-error 2-adic complexity of periodic binary sequences

被引：15
|
作者：
Hu, Honggang [1 ]
Feng, Dengguo [1 ]
机构：
[1] Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2008年 / 54卷 / 02期
基金：
加拿大自然科学与工程研究理事会;
关键词：
2-adic complexity; expected value; k-error 2-adic complexity; k-error symmetric 2-adic complexity; l-sequence; periodic binary sequence; symmetric 2-adic complexity; variance;
D O I：
10.1109/TIT.2007.913238
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A significant difference between the linear complexity and the 2-adic complexity of periodic binary sequences is pointed out in this correspondence. Based on this observation, we present the concept of the symmetric 2-adic complexity of periodic binary sequences. The expected value of the 2-adic complexity is determined, and a lower bound on the expected value of the symmetric 2-adic complexity of periodic binary sequences is derived. We study the variance of the 2-adic complexity of periodic binary sequences, and the exact value for it is given. Because the 2-adic complexity of periodic binary sequences is unstable, we present the concepts of the k-error 2-adic complexity and the k-error symmetric 2-adic complexity, and lower bounds on them are also derived. In particular, we give tighter upper and lower bounds for the minimum 2-adic complexity of I-sequences by substituting two symbols within one period.
引用
收藏
页码：874 / 883
页数：10
相关论文
共 50 条
  • [41] A lower bound on the 2-adic complexity of the modified Jacobi sequence
    Yuhua Sun
    Qiang Wang
    Tongjiang Yan
    Cryptography and Communications, 2019, 11 : 337 - 349
  • [42] 2-Adic complexity of two constructions of binary sequences with period 4N and optimal autocorrelation magnitude
    Zibi Xiao
    Xiangyong Zeng
    Cryptography and Communications, 2021, 13 : 865 - 885
  • [43] Comments on "A New Method to Compute the 2-Adic Complexity of Binary Sequences" (vol 56, pg 450, 2010)
    Hu, Honggang
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (09) : 5803 - 5804
  • [44] 2-Adic complexity of two constructions of binary sequences with period 4N and optimal autocorrelation magnitude
    Xiao, Zibi
    Zeng, Xiangyong
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2021, 13 (05): : 865 - 885
  • [45] On 2-adic deformations
    Vytautas Paškūnas
    Mathematische Zeitschrift, 2017, 286 : 801 - 819
  • [46] On 2-adic deformations
    Paskuenas, Vytautas
    MATHEMATISCHE ZEITSCHRIFT, 2017, 286 (3-4) : 801 - 819
  • [47] Fermat Number and 2-Adic Complexity of a Class of Maximum Period Sequence
    Wang Y.
    Li S.-B.
    Zhao S.
    Xue G.-N.
    Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications, 2018, 41 (02): : 81 - 85
  • [48] The symmetric 2-adic complexity of sequences with optimal autocorrelation magnitude and length 8q
    Vladimir Edemskiy
    Yuhua Sun
    Cryptography and Communications, 2022, 14 : 183 - 199
  • [49] The symmetric 2-adic complexity of sequences with optimal autocorrelation magnitude and length 8q
    Edemskiy, Vladimir
    Sun, Yuhua
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2022, 14 (02): : 183 - 199
  • [50] The 2-Adic Complexity of Ding-Helleseth Generalized Cyclotomic Sequences of Order 2 and Period pq
    Yan, Tongjiang
    Yan, Ming
    Sun, Yuhua
    Sun, Shiwen
    IEEE ACCESS, 2020, 8 : 140682 - 140687
12345