More constructions of pseudorandom sequences of \(k\) symbols (Q2434404): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ffa.2013.09.006 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.FFA.2013.09.006 / rank | |||
Normal rank | |||
Latest revision as of 14:52, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | More constructions of pseudorandom sequences of \(k\) symbols |
scientific article |
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
