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 条

[21] Periodic Sequences with Maximal Linear Complexity and Large k-Error Linear Complexity
Wilfried Meidl
Harald Niederreiter
Applicable Algebra in Engineering, Communication and Computing, 2003, 14 : 273 - 286
[22] 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
[23] On the k-error sequences of 2n-periodic binary sequences
Department of Applied Mathematics, Zhengzhou Information Engineering University, Zhengzhou 450002, China
Dianzi Yu Xinxi Xuebao, 2008, 11 (2592-2595): : 2592 - 2595
[24] Periodic sequences with maximal linear complexity and large k-error linear complexity
Meidl, W
Niederreiter, H
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2003, 14 (04) : 273 - 286
[25] On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
Meidl, W
Niederreiter, H
IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (11) : 2817 - 2825
[26] On the Cryptographic Properties of Binary 2n-periodic Sequences
Chang Zuling
Wen Qiaoyan
CHINESE JOURNAL OF ELECTRONICS, 2011, 20 (02): : 307 - 311
[27] Periodic sequences with large k-error linear complexity
Niederreiter, H
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (02) : 501 - 505
[28] Remarks on the k-error linear complexity of pn-periodic sequences
Wilfried Meidl
Ayineedi Venkateswarlu
Designs, Codes and Cryptography, 2007, 42 : 181 - 193
[29] 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
[30] 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

← 1 2 3 4 5 →