Properties of the Error Linear Complexity Spectrum

被引：21

作者：

Etzion, Tuvi ^{[1
]}

Kalouptsidis, Nicholas ^{[2
]}

Kolokotronis, Nicholas ^{[3
]}

Limniotis, Konstantinos ^{[2
]}

Paterson, Kenneth G. ^{[4
]}

机构：

[1] Technion Israel Inst Technol, Dept Comp Sci, IL-32000 Haifa, Israel

[2] Univ Athens, Dept Informat & Telecommun, Athens 15784, Greece

[3] Univ Peloponnese, Dept Comp Sci & Technol, Tripolis 22100, Greece

[4] Univ London, Informat Secur Grp, Egham TW20 0EX, Surrey, England

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2009年 / 55卷 / 10期

基金：

英国工程与自然科学研究理事会;

关键词：

Binary sequences; linear complexity; BINARY SEQUENCES; PERFECT MAPS; PERIOD; ALGORITHM;

D O I：

10.1109/TIT.2009.2027495

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper studies the error linear complexity spectrum of binary sequences with period 2(n). A precise categorization of those sequences having two distinct critical points in their spectra, as well as an enumeration of these sequences, is given. An upper bound on the maximum number of distinct critical points that the spectrum of a sequence can have is proved, and a construction which yields a lower bound on this number is given. In the process simpler proofs of some known results on the linear complexity and k-error linear complexity of sequences with period 2(n) are provided.

引用

页码：4681 / 4686

页数：6

共 18 条

[1]

DING C, 1991, LECT NOTES COMPUTER

[2]

DING C, 1990, LECT NOTES COMPUTER, V453, P39

[3] CONSTRUCTIONS FOR PERFECT MAPS AND PSEUDORANDOM ARRAYS [J].

ETZION, T .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (05) :1308-1316

[4]

ETZION T, 2008, P INT S INF THEOR JU, P2400

[5] A FAST ALGORITHM FOR DETERMINING THE COMPLEXITY OF A BINARY SEQUENCE WITH PERIOD 2N [J].

GAMES, RA ;

CHAN, AH .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (01) :144-146

[6] On the k-error linear complexity of pm-periodic binary sequences [J].

Han, Yun Kyoung ;

Chung, Jin-Ho ;

Yang, Kyeongcheol .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (06) :2297-2304

[7] Minimum linear span approximation of binary sequences [J].

Kolokotronis, N ;

Rizomiliotis, P ;

Kalouptsidis, N .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (10) :2758-2764

[8] A relationship between linear complexity and k-error linear complexity [J].

Kurosawa, K ;

Sato, F ;

Sakata, T ;

Kishimoto, W .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) :694-698

[9] Computing the error linear complexity spectrum of a binary sequence of period 2n [J].

Lauder, AGB ;

Paterson, KG .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (01) :273-280

[10]

MASSEY JL, 1969, IEEE T INFORM THEORY, V15, P122, DOI 10.1109/TIT.1969.1054260

← 1 2 →