Interval algorithm for random number generation

DOI10.1109/18.556116zbMATH Open0876.65001OpenAlexW2162346812MaRDI QIDQ4340328FDOQ4340328

Authors: Te Sun Han, Mamoru Hoshi 

Publication date: 12 November 1997

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

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

Recommendations

• scientific article; zbMATH DE number 1512196
• Algorithms for Generating Discrete Random Variables with a Given Generating Function or a Given Moment Sequence
• scientific article; zbMATH DE number 1568867
• The generation of binary trees as a numerical problem
• Optimized random number generation in an interval

zbMATH Keywords

random number generationinterval algorithm

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Arithmetic codes (94B40) Interval and finite arithmetic (65G30)

Cited In (11)

• Improved device-independent randomness expansion rates using two sided randomness
• The expected bit complexity of the von Neumann rejection algorithm
• Interval Algorithm for Random Number Generation: Information Spectrum Approach
• Optimized random number generation in an interval
• On the complexity of binary floating point pseudorandom generation
• Title not available (Why is that?)
• Randomness extraction in computability theory
• Coalgebraic tools for randomness-conserving protocols
• Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and applications
• Universal finitary codes with exponential tails
• Simple and tight device-independent security proofs

This page was built for publication: Interval algorithm for random number generation

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