Chapter Measures of Pseudorandomness

• Main Author: Gyarmati, Katalin (auth)
• Other Authors: Charpin, Pascale (Editor), Pott, Alexander (Editor), Winterhof, Arne (Editor)
• Format: eBook
• Published: Berlin/Boston De Gruyter 2013
• Subjects: Algebra; Applied mathematics; Computer science; Character sum; Exponential sum; Permutation Polynomial; Almost Perfect Nonlinear Function; Finite Field
• Online Access: Get fulltext
• ISBN: 9783110283600.43; 9783110282405
• Access: Open Access

In the second half of the 1990s Christian Mauduit and András Sárközy [86] introduced a new quantitative theory of pseudorandomness of binary sequences. Since then numerous papers have been written on this subject and the original theory has been generalized in several directions. Here I give a survey of some of the most important results involving the new quantitative pseudorandom measures of finite bi-nary sequences. This area has strong connections to finite fields, in particular, some of the best known constructions are defined using characters of finite fields and their pseudorandom measures are estimated via character sums.