Code generator matrices as RNG conditioners
From MaRDI portal
Abstract: We quantify precisely the distribution of the output of a binary random number generator (RNG) after conditioning with a binary linear code generator matrix by showing the connection between the Walsh spectrum of the resulting random variable and the weight distribution of the code. Previously known bounds on the performance of linear binary codes as entropy extractors can be derived by considering generator matrices as a selector of a subset of that spectrum. We also extend this framework to the case of non-binary codes.
Recommendations
- Matrix generator of pseudorandom numbers
- scientific article; zbMATH DE number 4024597
- On binary cyclic codes of odd lengths from 101 to 127
- Pseudorandom Vector Generation by the Multiple-Recursive Matrix Method
- Source codes as random number generators
- Efficient generation of random nonsingular matrices
- On Systematic Generator Matrices for Reed–Solomon Codes
- scientific article; zbMATH DE number 1498810
- The multiple-recursive matrix method for pseudorandom number generation
Cites work
- An introduction to randomness extractors
- Analysis and Construction of Correctors
- Application of Walsh Transform to Statistical Analysis
- Convergence Rates for Markov Chains
- scientific article; zbMATH DE number 1185220 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- Post-Processing Functions for a Biased Physical Random Number Generator
This page was built for publication: Code generator matrices as RNG conditioners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2401956)