On the pseudorandomness of binary and quaternary sequences linked by the gray mapping

1. N. Alon, Y. Kohayakawa, C. Mauduit, C. G. Moreira and V. Rödl, Measures of pseudorandomness for finite sequences: typical values, Proc. Lond. Math. Soc., 95 (2007), 778–812.

   Article  MATH  MathSciNet  Google Scholar 

2. G. Bérczi, On finite pseudorandom sequences of k symbols, Period. Math. Hungar., 47 (2003), 29–44.

   Article  MATH  MathSciNet  Google Scholar 

3. N. Brandstätter and A. Winterhof, Linear complexity profile of binary sequences with small correlation measure, Period. Math. Hungar., 52 (2006), 1–8.

   Article  MATH  Google Scholar 

4. J. Cassaigne, C. Mauduit and A. Sárközy, On finite pseudorandom binary sequences. VII. The measures of pseudorandomness, Acta Arith., 103 (2002), 97–118.

   Article  MATH  MathSciNet  Google Scholar 

5. L. Goubin, C. Mauduit and A. Sárközy, Construction of large families of pseudorandom binary sequences, J. Number Theory, 106 (2004), 56–69.

   Article  MATH  MathSciNet  Google Scholar 

6. Y.-S. Kim, J.-W. Jang, S.-H. Kim and J.-S. No, New quaternary sequences with optimal autocorrelation, ISIT 2009, 286–289.

7. S. M. Krone and D. V. Sarwate, Quadriphase sequences for spread-spectrum multiple-access communication, IEEE Trans. Inform. Theory, 30 (1984), 520–529.

   Article  MATH  MathSciNet  Google Scholar 

8. H. D. Lüke, H.D. Schotten and H. Hadinejad-Mahram, Binary and quadriphase sequences with optimal autocorrelation properties: a survey, IEEE Trans. Inform. Theory, 49 (2003), 3271–3282.

   Article  MathSciNet  Google Scholar 

9. 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.

   MATH  MathSciNet  Google Scholar 

10. C. Mauduit and A. Sárközy, On finite pseudorandom sequences of k-symbols, Indag. Math. (N.S.), 13 (2002), 89–101.

    Article  MATH  MathSciNet  Google Scholar 

11. H. Niederreiter, Linear complexity and related complexity measures for sequences, Progress in cryptology—INDOCRYPT 2003, Lecture Notes in Comput. Sci. 2904, Springer, Berlin, 2003, 1–17.

    Google Scholar 

12. A. Sárközy, On finite pseudorandom binary sequences and their applications in cryptography, Tatra Mt. Math. Publ., 37 (2007), 123–136.

    MATH  MathSciNet  Google Scholar 

13. A. Topuzoğlu and A. Winterhof, Pseudorandom sequences. Topics in geometry, coding theory and cryptography, Algebr. Appl. 6, Springer, Dordrecht, 2007, 135–166.

    Google Scholar 

14. A. Winterhof, Linear complexity and related complexity measures, Selected Topics in Information and Coding Theory, to appear.

Download references