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

来源：

Wuhan University Journal of Natural Sciences | 2013年 / 18卷 / 01期

关键词：

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 条

[41] Analysis of the k-Error Linear Complexity and Error Sequence for 2pn-Periodic Binary Sequence [J].

Niu, Zhihua ;

Kong, Deyu ;

Ren, Yanli ;

Du, Xiaoni .

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2018, E101A (08) :1197-1203

[42] Linear Complexity of a Family of Binary pq2-Periodic Sequences From Euler Quotients [J].

Zhang, Jingwei ;

Gao, Shuhong ;

Zhao, Chang-An .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (09) :5774-5780

[43] The cube theory for 2n-periodic binary sequences [J].

Zhou, Jianqin ;

Liu, Wanquan ;

Wang, Xifeng .

2015 9TH INTERNATIONAL CONFERENCE ON FUTURE GENERATION COMMUNICATION AND NETWORKING (FGCN), 2015, :1-4

[44] Cube Theory and Stable k-Error Linear Complexity for Periodic Sequences [J].

Zhou, Jianqin ;

Liu, Wanquan ;

Zhou, Guanglu .

INFORMATION SECURITY AND CRYPTOLOGY, INSCRYPT 2013, 2014, 8567 :70-85

[45] New Results on Periodic Sequences With Large k-Error Linear Complexity [J].

Hu, Honggang ;

Gong, Guang ;

Feng, Dengguo .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (10) :4687-4694

[46] Remarks on the k-error linear complexity of pn-periodic sequences [J].

Meidl, Wilfried ;

Venkateswarlu, Ayineedi .

DESIGNS CODES AND CRYPTOGRAPHY, 2007, 42 (02) :181-193

[47] How to determine linear complexity and k-error linear complexity in some classes of linear recurring sequences [J].

Meidl, Wilfried .

CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2009, 1 (01) :117-133

[48] On the Error Linear Complexity of Some Generalized Cyclotomic Sequences of Order Two of Period pq [J].

Yan, Chi .

IEEE ACCESS, 2024, 12 :109210-109217

[49] Asymptotic analysis on the normalized k-error linear complexity of binary sequences [J].

Tan, Lin ;

Qi, Wen-Feng ;

Xu, Hong .

DESIGNS CODES AND CRYPTOGRAPHY, 2012, 62 (03) :313-321

[50] Algorithm for Computing the k-error Linear Complexity and the Corresponding Error Sequence of 2p(n)-periodic Sequences over GF(q) [J].

Niu Zhihua ;

Kong Deyu .

JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY, 2018, 40 (07) :1723-1730

← 1 2 3 4 5 →