Some Algorithms for the Error Linear Complexity of Binary 2~n-Periodic Sequences

被引:0
|
作者
CHANG Zuling [1 ]
WANG Xueyuan [2 ]
DUAN Li [1 ]
机构
[1] Department of Mathematics, Zhengzhou University
[2] School of Information Engineering,Zhengzhou University
基金
中国国家自然科学基金;
关键词
sequence; linear complexity; error linear complexity; error linear complexity spectrum;
D O I
暂无
中图分类号
TN918.1 [理论];
学科分类号
070104 ;
摘要
Based on the Games-Chan algorithm and StampMartin algorithm, this paper provides some new algorithms to compute the error linear complexity spectrum of binary 2n-periodic se-quences. These new algorithms are clearer and simpler than old algorithms, and they can quickly compute the error linear complexity spectrum of sequences according to different situations. We also discuss such algorithms and give some new results about linear complexity and error linear complexity of sequences.
引用
收藏
页码:42 / 48
页数:7
相关论文
共 50 条
  • [2] THE 2-ERROR LINEAR COMPLEXITY OF 2~n-PERIODIC BINARY SEQUENCES WITH LINEAR COMPLEXITY 2~n-1
    Zhu Fengxiang Qi Wenfeng (Department of Applied Mathematics
    Journal of Electronics(China), 2007, (03) : 390 - 395
  • [3] On the First and Second Critical Error Linear Complexity of Binary 2n-periodic Sequences
    Chang Zuling
    Wang Xueyuan
    CHINESE JOURNAL OF ELECTRONICS, 2013, 22 (01): : 1 - 6
  • [4] The 2-error linear complexity of 2n-periodic binary sequences
    Zhu Fengxiang
    Qi Wenfeng
    CHINESE JOURNAL OF ELECTRONICS, 2008, 17 (02): : 356 - 360
  • [5] Linear Complexity of n-Periodic Cyclotomic Sequences over Fp
    Wang, Qiuyan
    Yan, Yang
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2020, E103A (05) : 785 - 791
  • [6] The Linear Complexity and 2-Error Linear Complexity Distribution of 2n-Periodic Binary Sequences with Fixed Hamming Weight
    Pan, Wenlun
    Bao, Zhenzhen
    Lin, Dongdai
    Liu, Feng
    INFORMATION AND COMMUNICATIONS SECURITY, ICICS 2016, 2016, 9977 : 107 - 123
  • [7] STRUCTURE ANALYSIS ON THE κ-ERROR LINEAR COMPLEXITY FOR 2n-PERIODIC BINARY SEQUENCES
    Zhou, Jianqin
    Liu, Wanquan
    Wang, Xifeng
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2017, 13 (04) : 1743 - 1757
  • [8] The Distribution of 2n-Periodic Binary Sequences with Fixed k-Error Linear Complexity
    Pan, Wenlun
    Bao, Zhenzhen
    Lin, Dongdai
    Liu, Feng
    INFORMATION SECURITY PRACTICE AND EXPERIENCE, ISPEC 2016, 2016, 10060 : 13 - 36
  • [9] A counterexample concerning the 3-error linear complexity of 2n-periodic binary sequences
    Jianqin Zhou
    Designs, Codes and Cryptography, 2012, 64 : 285 - 286
  • [10] Characterization of 2n-periodic binary sequences with fixed 2-error or 3-error linear complexity
    Ramakanth Kavuluru
    Designs, Codes and Cryptography, 2009, 53 : 75 - 97