Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part II
From MaRDI portal
Publication:5504194
DOI10.1007/11889342_17zbMath1164.11034OpenAlexW4238937109MaRDI QIDQ5504194
Christian Mauduit, András Sárközy, Rudolf Ahlswede
Publication date: 22 January 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11889342_17
Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items
A new lower bound on the family complexity of Legendre sequences ⋮ Construction of k-ary pseudorandom elliptic curve sequences ⋮ On the correlation of families of pseudorandom sequences of $k$ symbols ⋮ On the pseudorandom properties of \(k\)-ary Sidel'nikov sequences ⋮ Linear complexity profile of \(m\)-ary pseudorandom sequences with small correlation measure ⋮ More constructions of pseudorandom sequences of \(k\) symbols ⋮ Pseudo-randomness of certain sequences of \(k\) symbols with length \(pq\) ⋮ General theory of information transfer: Updated ⋮ On finite pseudorandom binary lattices ⋮ On the correlation of binary sequences ⋮ Family Complexity and VC-Dimension ⋮ Construction of large families of pseudorandom binary sequences ⋮ On the complexity of a family of Legendre sequences with irreducible polynomials ⋮ On pseudorandom sequences of \(k\) symbols constructed using finite fields ⋮ More constructions of pseudorandom lattices of \(k\) symbols
