R. Ahlswede, L. H. Khachatrian, C. Mauduit, and A. Sarkazy, A complexity measure for families of binary sequences, Periodica Math, Hungar, vol.46, pp.107-118, 2003.

R. Ahlswede, C. Mauduit, and A. Sarkazy, Large families of pseudorandom sequences of k symbols and their complexity, Part 1, Part 11, Proceedings on General Theory of Information Transfer and Combinatorics

N. Alon, Y. Kohayakawa, C. Mauduit, C. G. Moreira, and V. , Measures of pseudorandomness for finite sequences: minimum values, Combinatorics, Probability and Computation

N. Alon, Y. Kohayakawa, C. Mauduit, C. G. Moreira, and V. , Measures of pseudorandomness for finite sequences: typical values, Proceedings of the London Mathematical Society, vol.95, issue.3
DOI : 10.1112/plms/pdm027

E. R. Berlekamp, Algebraic Coding Theory, 1968.
DOI : 10.1142/9407

J. Cassaigne, C. Mauduit, and A. Sarkazy, On finite pseudorandom binary sequences VII: The measures of pseudorandomness, Acta Arith, pp.97-118, 2002.

S. W. Golomb, Shift Register Sequences, 1967.
DOI : 10.1142/9361

L. Goubin, C. Mauduit, and A. Sarkazy, Construction of large families of pseudorandom binary sequences, Journal of Number Theory, vol.106, issue.1
DOI : 10.1016/j.jnt.2003.12.002

URL : https://hal.archives-ouvertes.fr/hal-00153104

K. Gyarmati, An inequality between the measures of pseudorandomness, Annales Univ. Sei. Budapest

K. Gyarmati, On a family of pseudorandom binary sequences, Periodica Math, Hungar, vol.49, issue.2, pp.1-19

K. Gyarmati, On a fast version of a pseudorandom generator, General Theory of Information Transfer and Combinatorics, Conference Proceedings

K. Gyarmati, On a Pseudorandom Property of Binary Sequences, The Ramanujan Journal, vol.8, issue.3, pp.289-302, 2004.
DOI : 10.1007/s11139-004-0139-z

K. Gyarmati, On the correlation of binary sequences, Studia Sei

D. R. Heath-brown, Zero-Free Regions for Dirichlet L-Functions, and the Least Prime in an Arithmetic Progression, Proc. London Math. Soc. 64, pp.265-338, 1992.
DOI : 10.1112/plms/s3-64.2.265

D. E. Knuth, The Art of Computer Programming, 1981.

N. Koblitz, A course in number theory and cryptography, Graduate Texts in Mathematics, vol.114, 1994.

J. L. Massey, Shift-register synthesis and BCH decoding, IEEE Transactions on Information Theory, vol.15, issue.1, pp.122-127, 1969.
DOI : 10.1109/TIT.1969.1054260

J. Matousek and J. Spencer, Discrepancy in arithmetic progresszon, J

C. Mauduit, Construction of pseudorandom finite sequences, unpublished lecture notes to the conference, Information Theory and Sorne Friendly Neighbours-ein Wunschkonzert, 2003.

C. Mauduit, J. Rivat, and A. Sark6zy, Construction of Pseudorandom Binary Sequences Using Additive Characters, Monatshefte f???r Mathematik, vol.141, issue.3
DOI : 10.1007/s00605-003-0112-8

C. Mauduit and A. Sârkozy, On Finite Pseudorandom Binary Sequences, Journal of Number Theory, vol.73, issue.2, pp.365-377, 1997.
DOI : 10.1006/jnth.1998.2286

C. Mauduit and A. Sârkozy, On the measures of pseudorandomness of binary sequences, Discrete Math, pp.195-207, 2003.

S. Pohlig and M. Hellman, An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.), IEEE Transactions on Information Theory, vol.24, issue.1, pp.106-110, 1978.
DOI : 10.1109/TIT.1978.1055817

K. F. Roth, Remark concerning integer sequences, Acta Arith, pp.257-260, 1964.
DOI : 10.4064/aa-9-3-257-260

URL : https://www.impan.pl/shop/publication/transaction/download/product/95469?download.pdf

A. Sârkozy, A finite pseudorandom binar'y sequence, Studia Sei, Math. Hungar, vol.38, pp.377-384, 2001.

W. M. Schmidt, Equation over Finite Fields, An Elementary Approach, Lecture Notes in Math, vol.536, 1976.
DOI : 10.1007/BFb0080437

A. Weil, Sur les courbes alg??briques et les vari??t??s qui s???en d??duisent (Introduction), 1948.
DOI : 10.1007/978-1-4757-1705-1_46