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

来源：

WuhanUniversityJournalofNaturalSciences | 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 条

[11] On the error linear complexity spectrum of pn-periodic binary sequences
Tang, Miao
Zhu, Shixin
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2013, 24 (06) : 497 - 505
[12] Characterization of 2 n -periodic binary sequences with fixed 2-error or 3-error linear complexity
Kavuluru, Ramakanth
DESIGNS CODES AND CRYPTOGRAPHY, 2009, 53 (02) : 75 - 97
[13] A counterexample concerning the 3-error linear complexity of 2n-periodic binary sequences
Zhou, Jianqin
DESIGNS CODES AND CRYPTOGRAPHY, 2012, 64 (03) : 285 - 286
[14] Counting Functions for the k-Error Linear Complexity of 2n-Periodic Binary Sequences
Kavuluru, Ramakanth
Klapper, Andrew
SELECTED AREAS IN CRYPTOGRAPHY, 2009, 5381 : 151 - 164
[15] The characterization of 2n-periodic binary sequences with fixed 1-error linear complexity
Fu, Fang-Wei
Niederreiter, Harald
Su, Ming
SEQUENCES AND THEIR APPLICATIONS - SETA 2006, 2006, 4086 : 88 - 103
[16] The k-error linear complexity distribution for -periodic binary sequences
Zhou, Jianqin
Liu, Wanquan
DESIGNS CODES AND CRYPTOGRAPHY, 2014, 73 (01) : 55 - 75
[17] On the Second Descent Points for the K-Error Linear Complexity of 2n-Periodic Binary Sequences
Zhou, Jianqin
Wang, Xifeng
Liu, Wanquan
PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, INFORMATION MANAGEMENT AND NETWORK SECURITY, 2016, 47 : 311 - 314
[18] 2n-Periodic Binary Sequences with Fixed k-Error Linear Complexity for k=2 or 3
Kavuluru, Ramakanth
SEQUENCES AND THEIR APPLICATIONS - SETA 2008, 2008, 5203 : 252 - 265
[19] Some Enumeration Results on Binary 2n-Periodic Sequences
Chang, Zuling
Re, Pinhui
Zhao, Yongcheng
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2017, 28 (02) : 171 - 184
[20] On the k-error linear complexity of pm-periodic binary sequences
Han, Yun Kyoung
Chung, Jin-Ho
Yang, Kyeongcheol
IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (06) : 2297 - 2304

← 1 2 3 4 5 →