Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I
From MaRDI portal
Publication:5504193
DOI10.1007/11889342_16zbMath1164.11033OpenAlexW2176409128MaRDI QIDQ5504193
András Sárközy, Christian Mauduit, 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_16
Combinatorics on words (68R15) Random number generation in numerical analysis (65C10) Information theory (general) (94A15) 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 ⋮ On the pseudo-randomness of subsets related to primitive roots ⋮ 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\) ⋮ On finite pseudorandom binary lattices ⋮ On pseudorandomness of families of binary sequences ⋮ Measures of pseudorandomness of finite binary lattices. II: The symmetry measures ⋮ On pseudorandom sequences of \(k\) symbols constructed using finite fields ⋮ SYSTEMS OF CONGRUENCES WITH PRODUCTS OF VARIABLES FROM SHORT INTERVALS ⋮ More constructions of pseudorandom lattices of \(k\) symbols
