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

DOI10.1016/J.ENDM.2005.07.023MaRDI QIDQ3439244zbMATH OpenOpenAlexFDO

Authors Christian Mauduit, András Sárközy, Rudolf Ahlswede

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

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

Cites work

• A complexity measure for families of binary sequences
• ARTIN'S CONJECTURE FOR PRIMITIVE ROOTS
• Construction of large families of pseudorandom binary sequences
• Construction of pseudorandom binary sequences using additive characters
• scientific article; zbMATH DE number 3702545 (Why is no real title available?)
• scientific article; zbMATH DE number 3467229 (Why is no real title available?)
• scientific article; zbMATH DE number 607286 (Why is no real title available?)
• scientific article; zbMATH DE number 2051161 (Why is no real title available?)
• scientific article; zbMATH DE number 3055095 (Why is no real title available?)
• On Artin's conjecture.
• On Concepts of Performance Parameters for Channels
• On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
• On finite pseudorandom binary sequences VII: The measures of pseudorandomness
• On finite pseudorandom sequences of k symbols.
• Remarks on the paper "Sur certaines hypothèses concernant les nombres premiers"
• Strong converse for identification via quantum channels
• Sur certaines hypothèses concernant les nombres premiers

Cited in

(1)

• Constructions of pseudorandom binary lattices using cyclotomic classes in finite fields

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439244)