Large families of pseudorandom sequences of k symbols and their complexity, Part II

DOI10.1016/j.endm.2005.07.023zbMath1158.11326OpenAlexW2000283569MaRDI QIDQ3439244

András Sárközy, Christian Mauduit

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.07.023

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (1)

Constructions of pseudorandom binary lattices using cyclotomic classes in finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On finite pseudorandom sequences of \(k\) symbols.
• A complexity measure for families of binary sequences
• Construction of pseudorandom binary sequences using additive characters
• Sur certaines hypothèses concernant les nombres premiers
• Remarks on the paper "Sur certaines hypothèses concernant les nombres premiers"
• ARTIN'S CONJECTURE FOR PRIMITIVE ROOTS
• On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
• Strong converse for identification via quantum channels
• On finite pseudorandom binary sequences VII: The measures of pseudorandomness
• On Concepts of Performance Parameters for Channels
• On Artin's conjecture.
• Construction of large families of pseudorandom binary sequences

This page was built for publication: Large families of pseudorandom sequences of k symbols and their complexity, Part II