Separation of random number generation and resolvability

DOI10.1109/18.868497MaRDI QIDQ2705953zbMATH OpenOpenAlexFDO

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

Publication date 19 March 2001

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

Full work available at URL https://doi.org/10.1109/18.868497

zbMATH Keywords

channel output statisticsrandom number generationresolvabilitysource-channel separation

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Coding theorems (Shannon theory) (94A24) Source coding (94A29)

Recommendations

• Resolution-stationary random number generators
• A separation of two randomness concepts
• Design of Practical and Provably Good Random Number Generators
• scientific article; zbMATH DE number 910854
• Guaranteeing the diversity of number generators
• Efficient deterministic and non-deterministic pseudorandom number generation
• Randomized algorithms and pseudorandom numbers
• scientific article; zbMATH DE number 7377983

Cited in

(2)

• Resolvability theory for the multiple-access channel
• On precise achievable conditions in resolvability problem based on the asymptotic normality

This page was built for publication: Separation of random number generation and resolvability

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