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 条
  • [21] New Results on Periodic Sequences With Large k-Error Linear Complexity
    Hu, Honggang
    Gong, Guang
    Feng, Dengguo
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (10) : 4687 - 4694
  • [22] Cube Theory and Stable k-Error Linear Complexity for Periodic Sequences
    Zhou, Jianqin
    Liu, Wanquan
    Zhou, Guanglu
    INFORMATION SECURITY AND CRYPTOLOGY, INSCRYPT 2013, 2014, 8567 : 70 - 85
  • [23] Asymptotic analysis on the normalized k-error linear complexity of binary sequences
    Tan, Lin
    Qi, Wen-Feng
    Xu, Hong
    DESIGNS CODES AND CRYPTOGRAPHY, 2012, 62 (03) : 313 - 321
  • [24] Asymptotic analysis on the normalized k-error linear complexity of binary sequences
    Lin Tan
    Wen-Feng Qi
    Hong Xu
    Designs, Codes and Cryptography, 2012, 62 : 313 - 321
  • [25] Computing the k-error joint linear complexity of binary periodic multisequences
    LI Fu-lin
    ZHU Shi-xin
    The Journal of China Universities of Posts and Telecommunications, 2013, 20 (06) : 96 - 101
  • [26] Remarks on the k-error linear complexity of pn-periodic sequences
    Wilfried Meidl
    Ayineedi Venkateswarlu
    Designs, Codes and Cryptography, 2007, 42 : 181 - 193
  • [27] ON THE k-ERROR LINEAR COMPLEXITY FOR pn-PERIODIC BINARY SEQUENCES VIA HYPERCUBE THEORY
    Zhou, Jianqin
    Liu, Wanquan
    Wang, Xifeng
    Zhou, Guanglu
    MATHEMATICAL FOUNDATIONS OF COMPUTING, 2019, 2 (04): : 279 - 297
  • [28] On the k-error linear complexity of generalised cyclotomic sequences
    Liu L.
    Yang X.
    Du X.
    Wei B.
    Liu, Longfei (ya_zhou_521@163.com), 1600, Inderscience Enterprises Ltd., 29, route de Pre-Bois, Case Postale 856, CH-1215 Geneva 15, CH-1215, Switzerland (09): : 394 - 400
  • [29] AN ALGORITHM FOR THE K-ERROR LINEAR COMPLEXITY OF BINARY SEQUENCES WITH PERIOD-2(N)
    STAMP, M
    MARTIN, CF
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (04) : 1398 - 1401
  • [30] On the k-error linear complexity of l-sequences
    Tan, Lin
    Qi, Wen-Feng
    FINITE FIELDS AND THEIR APPLICATIONS, 2010, 16 (06) : 420 - 435
12345