The linear complexity of generalized cyclotomic sequences with period 2pn

被引：0

作者：

Edemskiy, Vladimir ^{[1
]}

Antonova, Olga ^{[1
]}

机构：

[1] Novgorod State Univ, Veliky Novgorod 173003, Russia

来源：

APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING | 2014年 / 25卷 / 03期

关键词：

Binary sequences; Generalized cyclotomy; Linear complexity; BINARY SEQUENCES; CODES;

D O I：

10.1007/s00200-014-0223-6

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

We found the linear complexity of generalized cyclotomic sequences with period based on quadratic, biquadratic and partially sextic residues. Our method is based on the generating the polynomial of the classical cyclotomic sequences, which allows us to obtain some well-known results and also some new results.

引用

页码：213 / 223

页数：11

共 20 条

[1] [Anonymous], 2016, HDB APPL CRYPTOGRAPH
[2] [Anonymous], 2005, SIGNAL DESIGN GOOD C
[3] Cunsheng Ding, 1998, Finite Fields and their Applications, V4, P140, DOI 10.1006/ffta.1998.0207
[4] Cusick T. W., 1998, STREAM CIPHERS NUMBE
[5] On the linear complexity of legendre sequences
Ding, CS
Helleseth, T
Shan, WJ
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (03) : 1276 - 1278
[6] Cyclotomy and duadic codes of prime lengths
Ding, CS
Pless, V
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (02) : 453 - 466
[7] Generalized cyclotomic codes of length p1e1•••ptet
Ding, CS
Helleseth, T
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (02) : 467 - 474
[8] New families of binary sequences with optimal three-level autocorrelation
Ding, CS
Helleseth, T
Martinsen, H
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (01) : 428 - 433
[9] Edemskii VA, 2010, DISCRET MATH APPL, V20, P75, DOI 10.1515/DMA.2010.004
[10] About computation of the linear complexity of generalized cyclotomic sequences with period p n+1
Edemskiy, Vladimir
[J]. DESIGNS CODES AND CRYPTOGRAPHY, 2011, 61 (03) : 251 - 260

← 1 2 →