A complexity measure for families of binary sequences

Periodica Mathematica Hungarica

Volumn 46, Issue 2, 2003, Pages 107-118

  Ahlswede, Rudolf ^a   Khachatrian, Levon H ^a   Mauduit, C ^b   Sarkozy A ^c  

^a BIELEFELD UNIVERSITY   (Germany)

^b AIX MARSEILLE UNIVERSITÉ   (France)

^c EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

binary sequence; complexity; covering hypergraphs; Legendre symbol; pseudorandom; specification

Indexed keywords

EID: 34247096969     PISSN: 00315303     EISSN: 15882829     Source Type: Journal    
DOI: 10.1023/A:1025962825241     Document Type: Article

References (9)

1. R. Ahlswede, Coloring hypergraphs: A new approach to multi-user source coding, Part I, Journ. of Combinatorics, Information and System Sciences, 4, No. 1 (1979), 76–115; Part II, Journ. of Combinatorics, Information and System Sciences, 5, No. 3 (1980), 220–268.
2. J. Cassaigne, C. Mauduit and A. SÁrközy, On finite pseudorandom binary sequences VII: The measures of pseudorandomness, Acta Arith. (to appear).
3. L. Goubin, C. Mauduit and A. SÁrkÖzy, Construction of large families of pseudorandom binary sequences, J. Number Theory (to appear).
4. C. Mauduit and A. SÁrkÖzy, On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol, Acta Arith. 82, (1997), 365–377.
5. C. Mauduit and A. SÁrkÖzy, On finite pseudorandom sequences of k symbols, Indagationes Math. (to appear).
6. U. maurer and J. L. Massey, Local randomness in pseudorandom sequences, J. Cryptology 4 (1991), 135–149. DOI: 10.1007/BF00196773
7. A. SÁrkÖzy, A finite pseudorandom binary sequence, Studia Sci. Math. Hungar. 38 (2001), 377–384.
8. C. P. Schnorr, On the construction of random number generators and random function generators, Advances in Cryptology – EUROCRYPT' 88 (LNCS 330), 1988, 225–232.
9. A. Weil, Sur les courbes algébriques et les variétés qui s'en déduisent, Act. Sci. Ind. 1041, Hermann, Paris, 1948.