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 条
  • [21] Probabilistic results on the 2-adic complexity
    Chen, Zhixiong
    Winterhof, Arne
    DESIGNS CODES AND CRYPTOGRAPHY, 2025,
  • [22] Maximum-Order Complexity and 2-Adic Complexity
    Chen, Zhiru
    Chen, Zhixiong
    Obrovsky, Jakob
    Winterhof, Arne
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (08) : 6060 - 6067
  • [23] A Fog Computing Security: 2-Adic Complexity of Balanced Sequences
    Hui-Juan, Wang
    Yong, Jiang
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2018,
  • [24] Fourier transforms and the 2-adic span of periodic binary sequences
    Goresky, M
    Klapper, A
    Washington, L
    1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 102 - 102
  • [25] Fourier transforms and the 2-adic span of periodic binary sequences
    Goresky, M
    Klapper, AM
    Washington, L
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) : 687 - 691
  • [26] 2-Adic Complexity of Two Classes of Generalized Cyclotomic Binary Sequences with Order 4
    Du, Xiaoni
    Zhao, Liping
    Niu, Zhihua
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2019, E102A (11) : 1566 - 1570
  • [27] Computing the k-error 2-adic complexity of a binary sequence of period pn
    Dong, Lihua
    Hu, Yupu
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2006, 6 (3A): : 66 - 70
  • [28] Balanced Whiteman Generalized Cyclotomic Sequences with Maximal 2-adic Complexity
    Zhao, Chun-e
    Sun, Yuhua
    Yan, Tongjiang
    Zhao, Xubo
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2022, E105A (03) : 603 - 606
  • [29] Computing the 2-Adic Complexity of Two Classes Generalized Cyclotomic Sequences
    Sun, Shiwen
    Yan, Tongjiang
    Sun, Yuhua
    Yan, Ming
    IEEE ACCESS, 2020, 8 : 140478 - 140485
  • [30] Linear complexity over Fq and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation
    Wang, Yan
    Han, Xilin
    Wang, Weiqiong
    Heng, Ziling
    DESIGNS CODES AND CRYPTOGRAPHY, 2022, 90 (08) : 1695 - 1712
12345