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
来源
关键词
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 条
  • [41] Analysis of the k-Error Linear Complexity and Error Sequence for 2pn-Periodic Binary Sequence
    Niu, Zhihua
    Kong, Deyu
    Ren, Yanli
    Du, Xiaoni
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2018, E101A (08): : 1197 - 1203
  • [42] A fast algorithm for the k-error linear complexity of a binary sequence
    Wei, SM
    Chen, Z
    Xiao, GZ
    2001 INTERNATIONAL CONFERENCES ON INFO-TECH AND INFO-NET PROCEEDINGS, CONFERENCE A-G: INFO-TECH & INFO-NET: A KEY TO BETTER LIFE, 2001, : E152 - E157
  • [43] COMPLETE CHARACTERIZATION OF THE FIRST DESCENT POINT DISTRIBUTION FOR THE k-ERROR LINEAR COMPLEXITY OF 2-PERIODIC BINARY SEQUENCES
    Zhou, Jianqin
    Liu, Wanquan
    Wang, Xifeng
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2017, 11 (03) : 429 - 444
  • [44] On the k-error linear complexity of binary sequences of periods pn from new cyclotomy
    Edemskiy, Vladimir
    Wu, Chenhuang
    AIMS MATHEMATICS, 2022, 7 (05): : 7997 - 8011
  • [45] Linear complexity, k-error linear complexity, and the discrete Fourier transform
    Meidl, W
    Niederreiter, H
    JOURNAL OF COMPLEXITY, 2002, 18 (01) : 87 - 103
  • [46] ON THE k-ERROR LINEAR COMPLEXITY OF SEQUENCES FROM FUNCTION FIELDS
    Zhou, Yuhui
    Han, Yuhui
    Ding, Yang
    BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2020, 102 (02) : 342 - 352
  • [47] Relationship between linear complexity and κ-error complexity of binary periodic sequences
    Bai, Enjian
    Zhang, Bin
    Xiao, Guozhen
    Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, 2002, 24 (12): : 1821 - 1824
  • [48] ON k-ERROR LINEAR COMPLEXITY OF PSEUDORANDOM BINARY SEQUENCES DERIVED FROM EULER QUOTIENTS
    Chen, Zhixiong
    Edemskiy, Vladimir
    Ke, Pinhui
    Wu, Chenhuang
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2018, 12 (04) : 805 - 816
  • [49] A typical profile of the k-error linear complexity for balanced binary sequences with period 2n
    Kaida, T
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2005, E88A (01) : 311 - 313
  • [50] On k-Error Linear Complexity of Some Explicit Nonlinear Pseudorandom Sequences
    CHEN Zhixiong1
    2. Key Laboratory of Network Security and Cryptology
    WuhanUniversityJournalofNaturalSciences, 2008, (05) : 577 - 581