Finite and infinite pseudorandom binary words

Theoretical Computer Science

Volumn 273, Issue 1-2, 2002, Pages 249-261

  Mauduit, Christian ^a  

^a AIX MARSEILLE UNIVERSITÉ   (France)

Author keywords

Correlation; Finite word; Pseduorandomness

Indexed keywords

COMPUTATIONAL COMPLEXITY; CORRELATION METHODS; DIGITAL ARITHMETIC; PROBABILISTIC LOGICS; THEOREM PROVING;

PSEUDORANDOM BINARY WORDS;

BINARY SEQUENCES;

EID: 0037186208     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00443-6     Document Type: Article

References (30)

1. On a paper of Niven and Zuckerman
2. On finite pseudorandom binary sequences III: The Liouville function, I
3. On finite pseudorandom binary sequences IV: The Liouville function, II
4. The construction of decimals normal in the scale of ten
5. On the correlation of multiplicative functions
6. On the correlation of multiplicative and the sum of additive arithmetic functions
7. Problem E 3025
8. Über die Mittelwerte miltiplikativer zahlentheoretischer Funktionen
9. A note on the Möbius and the Liouville function
10. Multiplicative functions at consecutive integers
11. On consecutive values of the Liouville function
12. On table of random numbers
13. Finite fields
14. On finite pseudorandom binary sequences I: Measure of pseudorandomness, the legengre symbol
15. On finite pseudorandom binary sequences II: The Champernowne, Rudin-Shapiro and Thue-Morse sequences. A further construction
16. On the definition of normal numbers
17. Substitution dynamical systems - Spectral analysis
18. Some theorems on fourier coefficients
19. Remarks on the paper Sur certaines hypothèses concernant les nombres premiers
20. Sur certaines hypothèses concernant les nombres premiers
21. On multiplicative arithmetic functions satisfying a linear recursion