Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I

DOI10.1007/11889342_16zbMath1164.11033MaRDI 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

zbMATH Keywords

complexity; measures of pseudorandomness; pseudorandom sequences

Mathematics Subject Classification ID

68R15: Combinatorics on words

65C10: Random number generation in numerical analysis

94A15: Information theory (general)

11K45: Pseudo-random numbers; Monte Carlo methods

Related Items

On the pseudorandom properties of \(k\)-ary Sidel'nikov sequences, On finite pseudorandom binary lattices, On pseudorandomness of families of binary sequences, Measures of pseudorandomness of finite binary lattices. II: The symmetry measures, Linear complexity profile of \(m\)-ary pseudorandom sequences with small correlation measure, On pseudorandom sequences of \(k\) symbols constructed using finite fields, On the pseudo-randomness of subsets related to primitive roots, A new lower bound on the family complexity of Legendre sequences, More constructions of pseudorandom lattices of \(k\) symbols, More constructions of pseudorandom sequences of \(k\) symbols, Pseudo-randomness of certain sequences of \(k\) symbols with length \(pq\), SYSTEMS OF CONGRUENCES WITH PRODUCTS OF VARIABLES FROM SHORT INTERVALS, Construction of k-ary pseudorandom elliptic curve sequences, On the correlation of families of pseudorandom sequences of $k$ symbols