Almost sure convergence theorems of rate of coin tosses for random number generation by interval algorithm
説明
This paper deals with the interval algorithm proposed by Hen and Hoshi for random number generation, and evaluates the efficiency of the algorithm for each sample path instead of evaluating overall expectation. We show a theorem in the almost-sure sense to give bounds on the sup generating rate as well as on the inf generating rate for each sample of input and output processes.
収録刊行物
-
- 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)
-
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) 457-, 2002-11-07
IEEE
