On the Error Linear Complexity Spectrum of Binary Sequences with Period of Power of Two

被引：2

作者：

Chang Zuling ^{[1
]}

Ke Pinhui ^{[2
]}

机构：

[1] Zhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Peoples R China

[2] Fujian Normal Univ, Fujian Prov Key Lab Network Secur & Cryptol, Fuzhou 350007, Peoples R China

来源：

CHINESE JOURNAL OF ELECTRONICS | 2015年 / 24卷 / 02期

基金：

中国国家自然科学基金;

关键词：

Binary sequences; Games-Chan algorithm; Error linear complexity; Spectrum; 2(N)-PERIODIC SEQUENCES; ALGORITHM;

D O I：

10.1049/cje.2015.04.024

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

The properties of error linear complexity of binary sequences with period of power of two are studied in this paper. Using the Games-Chan algorithm as main tool, accurate formulas of the minimum value k for which the k-error linear complexity is strictly less than the first and second critical error linear complexity are provided respectively.

引用

页码：366 / 372

页数：7

共 14 条

[11] Menezes A. J., 1996, HDB APPL CRYPTOGRAPH
[12] RUPPEL R, 1986, ANAL DESIGN STREAM C
[13] On the computation of the linear complexity and the k-error linear complexity of binary sequences with period a power of two
Salagean, A
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (03) : 1145 - 1150
[14] AN ALGORITHM FOR THE K-ERROR LINEAR COMPLEXITY OF BINARY SEQUENCES WITH PERIOD-2(N)
STAMP, M
MARTIN, CF
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (04) : 1398 - 1401

← 1 2 →