A finite pseudorandom binary sequence

DOI10.1556/SScMath.38.2001.1-4.28zbMath0997.11062OpenAlexW2039342917MaRDI QIDQ4780298

András Sárközy

Publication date: 3 November 2002

Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1556/sscmath.38.2001.1-4.28

zbMATH Keywords

correlationindexpseudorandom sequence

Mathematics Subject Classification ID

Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (18)

A new lower bound on the family complexity of Legendre sequences ⋮ A complexity measure for families of binary sequences ⋮ Sequences related to Legendre/Jacobi sequences ⋮ On the correlation measures of subsets ⋮ On pseudorandom properties of some Dirichlet characters ⋮ On the pseudo-randomness of subsets related to primitive roots ⋮ Elliptic curve analogues of a pseudorandom generator ⋮ On the complexity of families of pseudo-random subsets ⋮ On pseudorandomness in families of sequences derived from the Legendre symbol ⋮ On pseudo-random subsets of the set of the integers not exceeding \(N\) ⋮ On finite pseudorandom binary lattices ⋮ Construction of large families of pseudorandom binary sequences ⋮ Pseudo-Randomness of Discrete-Log Sequences from Elliptic Curves ⋮ Construction of pseudorandom binary lattices based on multiplicative characters ⋮ On a problem of D.H. Lehmer and pseudorandom binary sequences ⋮ A large family of pseudorandom binary lattices ⋮ Construction of pseudorandom binary lattices using elliptic curves ⋮ Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)

This page was built for publication: A finite pseudorandom binary sequence