On a problem of D. H. Lehmer

DOI10.1090/S0002-9939-06-08558-3zbMath1160.11039OpenAlexW2005699670MaRDI QIDQ5898353

Stéphane R. Louboutin, András Sárközy, Joël Rivat

Publication date: 1 February 2007

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-06-08558-3

zbMATH Keywords

correlationpseudo-randombinary sequence

Mathematics Subject Classification ID

Gauss and Kloosterman sums; generalizations (11L05) Estimates on character sums (11L40) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (7)

GOWERS UNIFORMITY NORM AND PSEUDORANDOM MEASURES OF THE PSEUDORANDOM BINARY SEQUENCES ⋮ On the correlation measures of subsets ⋮ Modular hyperbolas ⋮ Representations of element as sum of primitive root and Lehmer number in 419_p ⋮ On a problem of D.H. Lehmer and pseudorandom binary sequences ⋮ A large family of pseudorandom binary lattices ⋮ Modified constructions of binary sequences using multiplicative inverse

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a problem of D. H. Lehmer and Kloosterman sums
• A problem of D. H. Lehmer and its mean square value formula.
• Modular constructions of pseudorandom binary sequences with composite moduli
• Construction of pseudorandom binary sequences by using the multiplicative inverse
• Exponential Sums and Goppa Codes: I
• Bounds for exponential sums and their applications to pseudorandom numbers
• On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
• On finite pseudorandom binary sequences VII: The measures of pseudorandomness
• On the pseudorandomness of the signs of Kloosterman sums
• Measures of pseudorandomness for finite sequences: typical values
• Unsolved problems in number theory

This page was built for publication: On a problem of D. H. Lehmer