Source codes as random number generators

DOI10.1109/18.661497MaRDI QIDQ4400265zbMATH OpenOpenAlexFDO

Authors Karthik Visweswariah, Sanjeev R. Kulkarni, Sergio Verdú

Publication date 2 August 1998

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/4055ff8eb6a3dc576078337d4876e359ffda0d1e

zbMATH Keywords

data compressionentropy rateLempel-Ziv algorithmrandom number generatoruniversal source coding

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Measures of information, entropy (94A17) Source coding (94A29)

Recommendations

• Source code with cost as a nonuniform random number generator
• Generating random bits from an arbitrary source: fundamental limits
• Optimal random number generation from a biased coin
• An efficient generation method for uniformly distributed random numbers

Cited in

(8)

• The entropy of a distributed computation random number generation from memory interleaving
• Exact output rate of Peres's algorithm for random number generation
• Code generator matrices as RNG conditioners
• scientific article; zbMATH DE number 4191551 (Why is no real title available?)
• Second-Order Asymptotics in Fixed-Length Source Coding and Intrinsic Randomness
• Source code with cost as a nonuniform random number generator
• On precise achievable conditions in resolvability problem based on the asymptotic normality
• Generating probabilities with a specified entropy

This page was built for publication: Source codes as random number generators

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