Linear complexity and k-error linear complexity for 2mpn-periodic binary sequences

被引：0
|
作者：
Tan, Lin [1 ]
Qi, Wen-Feng [1 ]
机构：
[1] College of Information Engineering, Zhengzhou Information Engineering University, Zhengzhou 450002, China
来源：
Tongxin Xuebao/Journal on Communications | 2008年 / 29卷 / 07期
关键词：
Computational complexity - Binary sequences;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The stability of the linear complexity was an important index to scale a sequence's randomicity. For 2mpn-periodic binary sequences, where p was a odd prime and 2 was a primitive root module p2, made use of the tools such as polynomial factorization, provides the bounds of the minimum value k such that the it-error linear complexity is strictly less than the linear complexity.
引用
收藏
页码：44 / 49
相关论文
共 50 条
  • [31] k-error linear complexity of binary cyclotomic generators
    Chen Z.
    Wu C.
    Tongxin Xuebao/Journal on Communications, 2019, 40 (02): : 197 - 206
  • [32] Decomposing Approach for Error Vectors of k-Error Linear Complexity of Certain Periodic Sequences
    Su, Ming
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2014, E97A (07) : 1542 - 1555
  • [33] A Hybrid Genetic Algorithm for Computing the k-Error Linear Complexity of Periodic Sequences
    Niu Z.
    Yuan C.
    Kong D.
    Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University, 2020, 54 (06): : 599 - 606
  • [34] On the k-error linear complexity of binary sequences derived from polynomial quotients
    CHEN ZhiXiong
    NIU ZhiHua
    WU ChenHuang
    ScienceChina(InformationSciences), 2015, 58 (09) : 83 - 97
  • [35] On the k-error linear complexity of binary sequences derived from polynomial quotients
    Chen ZhiXiong
    Niu ZhiHua
    Wu ChenHuang
    SCIENCE CHINA-INFORMATION SCIENCES, 2015, 58 (09) : 1 - 15
  • [36] A relationship between linear complexity and k-error linear complexity
    Kurosawa, K
    Sato, F
    Sakata, T
    Kishimoto, W
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) : 694 - 698
  • [37] How to determine linear complexity and k-error linear complexity in some classes of linear recurring sequences
    Meidl, Wilfried
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2009, 1 (01): : 117 - 133
  • [38] An algorithm for k-error joint linear complexity of binary multi-sequences
    Sethumadhavan, M.
    Sindhu, M.
    Srinivasan, Chungath
    Kavitha, C.
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2008, 11 (03): : 297 - 304
  • [39] How to determine linear complexity and k-error linear complexity in some classes of linear recurring sequences
    Wilfried Meidl
    Cryptography and Communications, 2009, 1 : 117 - 133
  • [40] On the 2-adic complexity and the k-error 2-adic complexity of periodic binary sequences
    Hu, HG
    Feng, DG
    SEQUENCES AND THEIR APPLICATIONS - SETA 2004, 2005, 3486 : 185 - 196
12345