Measures of pseudorandomness for finite sequences: Minimal values

Combinatorics Probability and Computing

Volumn 15, Issue 1-2, 2006, Pages 1-29

  Alon, N ^a   Kohayakawa, Y ^b   Mauduit, C ^c   Moreira, C G ^d   Rodl V ^e  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

^c AIX MARSEILLE UNIVERSITÉ   (France)

^d IMPA   (Brazil)

^e EMORY UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; BINARY SEQUENCES; COMBINATORIAL CIRCUITS; CORRELATION METHODS; NUMERICAL ANALYSIS;

CORRELATION MEASURES; FINITE SEQUENCES; NORMALITY MEASURES;

RANDOM PROCESSES;

EID: 29744440453     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548305007170     Document Type: Article

References (13)

1. Alon, N. (2003) Problems and results in extremal combinatorics I. In EuroComb'01 (Barcelona), Discrete Math. 273 31-53.
2. Alon, N., Kohayakawa, Y., Mauduit, C., Moreira, C. G. and Rödl, V. Measures of pseudorandomness for finite sequences: typical values. In preparation.
3. Carpi, A. and de Luca, A. (2004) Uniform words. Adv. Appl. Math. 32 485-522.
4. Cassaigne, J., Mauduit, C. and Sárközy, A. (2002) On finite pseudorandom binary sequences VII: The measures of pseudorandomness. Acta Arith. 103 97-118.
5. Codenotti, B., Pudlák, P. and Resta, G. (2000) Some structural properties of low-rank matrices related to computational complexity. In Selected Papers in Honor of Manuel Blum (Hong Kong, 1998), Theoret. Comput. Sci. 235 89-107.
6. de Bruijn, N. G. (1946) A combinatorial problem. Nederl. Akad. Wetensch., Proc. 49 758-764
7. (Indagationes Math. 8 (1946) 461-467).
8. Erdos, P. and Spencer, J. (1974) Probabilistic Methods in Combinatorics, Vol. 17 of Probability and Mathematical Statistics, Academic Press, New York/London.
9. Haselgrove, C. B. (1951) Some theorems in the analytic theory of numbers. J. London Math. Soc. 26 273-277.
10. MacWilliams, F. J. and Sloane, N. J. A. (1977) The Theory of Error-Correcting Codes II, Vol. 16 of North-Holland Mathematical Library, North-Holland, Amsterdam.
11. Mauduit, C. (2002) Finite and infinite pseudorandom binary words. In WORDS (Rouen, 1999), Theoret. Comput. Sci. 273 249-261.
12. Mauduit, C. and Sárközy, A. (1997) On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol. Acta Arith. 82 365-377.
13. Tietäväinen, A. (1980) Bounds for binary codes just outside the Plotkin range. Inform. and Control 47 85-93.