More constructions of pseudorandom sequences of \(k\) symbols (Q2434404)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6255361
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | More constructions of pseudorandom sequences of \(k\) symbols |
scientific article; zbMATH DE number 6255361 |
Statements
More constructions of pseudorandom sequences of \(k\) symbols (English)
0 references
5 February 2014
0 references
In a series of papers Mauduit, Sárkőzy (partly with coauthors) studied well-distribution and correlation measures for binary sequences. In the present paper pseudorandom sequences over arbitrary finite alphabets are studied. An interesting new construction related to Lehmer's problem is introduced. Applying exponential sum techniques, upper bounds for well-distribution and correlation measures of such sequences are established.
0 references
pseudorandom sequences
0 references
Lehmer problem
0 references
characters
0 references
exponential sums
0 references
correlation
0 references
0 references
0 references
0 references
0 references
0 references
0.9102634787559508
0 references
0.8953554034233093
0 references
0.8893728852272034
0 references
0.8876821398735046
0 references
0.8732126355171204
0 references
