On the linear complexity of legendre sequences

被引：135

作者：

Ding, CS ^{[1
]}

Helleseth, T

Shan, WJ

机构：

[1] Natl Univ Singapore, Dept Informat Syst & Comp Sci, Singapore 119260, Singapore

[2] Univ Bergen, Dept Informat, N-5020 Bergen, Norway

[3] Xidian Univ, Dept Math Appl, Xian 710071, Peoples R China

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1998年 / 44卷 / 03期

关键词：

codes; cryptography; Legendre sequence; sequence;

D O I：

10.1109/18.669398

中图分类号：

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

学科分类号：

0812 ;

摘要：

In this correspondence we determine the linear complexity of all Legendre sequences and the (monic) feedback polynomial of the shortest linear feedback shift register that generates such a Legendre sequence. The result of this correspondence shows that Legendre sequences are quite good from the linear complexity viewpoint.

引用

页码：1276 / 1278

页数：3

共 7 条

[1]

[Anonymous], 1983, ENCY MATH APPL

[2] LINEAR RECURSION PROPERTIES OF UNCORRELATED BINARY SEQUENCES [J].

BROMFIELD, AJ ;

PIPER, FC .

DISCRETE APPLIED MATHEMATICS, 1990, 27 (03) :187-193

[3]

DAMGARD IB, 1990, LECT NOTES COMPUT SC, V403, P163

[4]

DING C, 1994, LECT NOTES COMPUTER, V809, P101

[5] LEGENDRE SUMS AND CODES RELATED TO QR CODES [J].

HELLESETH, T .

DISCRETE APPLIED MATHEMATICS, 1992, 35 (02) :107-113

[6]

Ireland K., 1982, CLASSICAL INTRO MODE, DOI DOI 10.1007/978-1-4757-1779-2

[7]

Jungnickel D., 1993, Finite Fields: Structure and Arithmetics

← 1 →