Interval algorithm for random number generation

DOI10.1109/18.556116zbMath0876.65001OpenAlexW2162346812MaRDI QIDQ4340328

Mamoru Hoshi, T. S. Han

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

zbMATH Keywords

random number generationinterval algorithm

Mathematics Subject Classification ID

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

Related Items (7)

Randomness extraction in computability theory ⋮ The expected bit complexity of the von Neumann rejection algorithm ⋮ On the complexity of binary floating point pseudorandom generation ⋮ Simple and Tight Device-Independent Security Proofs ⋮ Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications ⋮ Coalgebraic tools for randomness-conserving protocols ⋮ Universal finitary codes with exponential tails

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