Construction of pseudorandom binary sequences using additive characters

被引：66

作者：

Mauduit, C

Rivat, J

Sárközy, A

机构：

[1] CNRS, Inst Math Luminy, UPR 9016, F-13288 Marseille 9, France

[2] Univ Henri Poincare, Inst Elie Cartan Nancy, F-54506 Vandoeuvre Les Nancy, France

[3] Eotvos Lorand Univ, Dept Algebra & Number Theory, H-1117 Budapest, Hungary

来源：

MONATSHEFTE FUR MATHEMATIK | 2004年 / 141卷 / 03期

关键词：

pseudo-random; binary sequence; additive character; correlation;

D O I：

10.1007/s00605-003-0112-8

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In earlier papers the authors studied finite pseudorandom binary sequences, and they constructed sequences with strong pseudorandom properties. In these earlier constructions multiplicative characters were used. In this paper a new construction is presented which utilizes properties of additive characters. These new sequences can be computed fast, they are well-distributed relative to arithmetic progressions and their correlations of "small" order are "small", but the price paid for the fast computation is that the correlations of "large" order can be "large".

引用

页码：197 / 208

页数：12

共 10 条

[1] BANKS WD, 2002, CHARACTER SUMS INTEG
[2] On finite pseudorandom binary sequences VII:: The measures of pseudorandomness
Cassaigne, J
Mauduit, C
Sárközy, A
[J]. ACTA ARITHMETICA, 2002, 103 (02) : 97 - 118
[3] GOUBIN L, 2002, IN PRESS J NUMBER TH
[4] Mauduit C, 1997, ACTA ARITH, V82, P365
[5] On finite pseudorandom sequences of k symbols
Mauduit, C
Sárközy, A
[J]. INDAGATIONES MATHEMATICAE-NEW SERIES, 2002, 13 (01): : 89 - 101
[6] STATISTICAL INDEPENDENCE OF NONLINEAR CONGRUENTIAL PSEUDORANDOM NUMBERS
NIEDERREITER, H
[J]. MONATSHEFTE FUR MATHEMATIK, 1988, 106 (02): : 149 - 159
[7] RIVAT J, 2002, PSEUDORANDOM BINARY
[8] A finite pseudorandom binary sequence
Sárközy, A
[J]. STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 2001, 38 : 377 - 384
[9] TIETAVAINEN A, 1988, LECT NOTES MATH, V1352, P190
[10] Weil A., 1948, COURBES ALGEBRIQUES, V7

← 1 →