On large families of subsets of the set of the integers not exceeding \(N\)

DOI10.1007/S11139-008-9135-ZzbMath1226.05006OpenAlexW1987500353MaRDI QIDQ987532

Cécile Dartyge, Elie Mosaki, András Sárközy

Publication date: 13 August 2010

Published in: The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11139-008-9135-z

zbMATH Keywords

pseudo-randomsubset

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Other combinatorial number theory (11B75) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (15)

Balance and pattern distribution of sequences derived from pseudorandom subsets of \(\mathbb{Z}_q\) ⋮ Gowers norms and pseudorandom measures of subsets ⋮ On multi-dimensional pseudorandom subsets ⋮ Constructing quasi-random subsets of \(\mathbb Z_N\) by using elliptic curves ⋮ On the correlation measures of subsets ⋮ On the pseudo-randomness of subsets related to primitive roots ⋮ On the symmetry measure of pseudorandom subsets ⋮ Extension of the notion of collision and avalanche effect to sequences of \(k\) symbols ⋮ On the complexity of families of pseudo-random subsets ⋮ Family Complexity and VC-Dimension ⋮ Large families of pseudo-random subsets formed by generalized cyclotomic classes ⋮ On pseudorandom subsets in finite fields. I: Measure of pseudorandomness and support of Boolean functions ⋮ On the pseudorandom properties of subsets constructed by using primitive roots ⋮ On pseudo-random subsets of \({\mathbb{Z}}_n\) ⋮ Large family of pseudorandom subsets of the set of the integers not exceeding N

Uses Software

• Gappa

Cites Work

• Unnamed Item
• Unnamed Item
• On \(p\)-pseudorandom binary sequences
• Statistical independence of nonlinear congruential pseudorandom numbers
• Equations over finite fields. An elementary approach
• Character sums over integers with restricted \(g\)-ary digits
• A complexity measure for families of binary sequences
• Construction of pseudorandom binary sequences using additive characters
• On pseudo-random subsets of the set of the integers not exceeding \(N\)
• 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 Exponential Sums in Finite Fields

This page was built for publication: On large families of subsets of the set of the integers not exceeding \(N\)