Generating Gaussian pseudorandom noise with binary sequences

DOI10.1007/978-3-031-81824-0_8MaRDI QIDQ6996922zbMATH OpenFDO

Authors Francisco-Javier Soto, Ana I. Gómez, Domingo Gómez-Pérez

Publication date 15 April 2025

Full work available at URL https://doi.org/10.1007/978-3-031-81824-0_8

zbMATH Keywords

\(m\)-sequencecentral limit theoremGaussian distributionGold codepseudorandom number generator

Mathematics Subject Classification ID

Pseudo-random numbers; Monte Carlo methods (11K45) Central limit and other weak theorems (60F05) Probabilistic models, generic numerical methods in probability and statistics (65C20)

Cites work

• A geometric derivation of the Irwin-Hall distribution
• Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
• Correlation measure of binary sequence families with trace representation
• Correlation measure, linear complexity and maximum order complexity for families of binary sequences
• Explicit formulae for product moments of multivariate Gaussian random variables
• scientific article; zbMATH DE number 53679 (Why is no real title available?)
• scientific article; zbMATH DE number 2002843 (Why is no real title available?)
• scientific article; zbMATH DE number 3078619 (Why is no real title available?)
• On a family of pseudorandom binary sequences
• On the Distribution of Sums of Successive Bits of Shift-Register Sequences

This page was built for publication: Generating Gaussian pseudorandom noise with binary sequences

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