IEICE TRANSACTIONS on Fundamentals
Open Access
Performance Analysis of the Interval Algorithm for Random Number Generation in the Case of Markov Coin Tossing
-
Full Text Views
35
- Cite this
- Free PDF (906.2KB)
Summary :
In this paper we analyze the interval algorithm for random number generation proposed by Han and Hoshi in the case of Markov coin tossing. Using the expression of real numbers on the interval [0,1), we first establish an explicit representation of the interval algorithm with the representation of real numbers on the interval [0,1) based one number systems. Next, using the expression of the interval algorithm, we give a rigorous analysis of the interval algorithm. We discuss the difference between the expected number of the coin tosses in the interval algorithm and their upper bound derived by Han and Hoshi and show that it can be characterized explicitly with the established expression of the interval algorithm.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E103-A No.12 pp.1325-1336
- Publication Date
- 2020/12/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.2020TAP0008
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
- Shannon Theory
Authors
Yasutada OOHAMA
The University of Electro-Communications
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yasutada OOHAMA, "Performance Analysis of the Interval Algorithm for Random Number Generation in the Case of Markov Coin Tossing" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 12, pp. 1325-1336, December 2020, doi: 10.1587/transfun.2020TAP0008.
Abstract: In this paper we analyze the interval algorithm for random number generation proposed by Han and Hoshi in the case of Markov coin tossing. Using the expression of real numbers on the interval [0,1), we first establish an explicit representation of the interval algorithm with the representation of real numbers on the interval [0,1) based one number systems. Next, using the expression of the interval algorithm, we give a rigorous analysis of the interval algorithm. We discuss the difference between the expected number of the coin tosses in the interval algorithm and their upper bound derived by Han and Hoshi and show that it can be characterized explicitly with the established expression of the interval algorithm.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2020TAP0008/_p
Copy
@ARTICLE{e103-a_12_1325,
author={Yasutada OOHAMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Performance Analysis of the Interval Algorithm for Random Number Generation in the Case of Markov Coin Tossing},
year={2020},
volume={E103-A},
number={12},
pages={1325-1336},
abstract={In this paper we analyze the interval algorithm for random number generation proposed by Han and Hoshi in the case of Markov coin tossing. Using the expression of real numbers on the interval [0,1), we first establish an explicit representation of the interval algorithm with the representation of real numbers on the interval [0,1) based one number systems. Next, using the expression of the interval algorithm, we give a rigorous analysis of the interval algorithm. We discuss the difference between the expected number of the coin tosses in the interval algorithm and their upper bound derived by Han and Hoshi and show that it can be characterized explicitly with the established expression of the interval algorithm.},
keywords={},
doi={10.1587/transfun.2020TAP0008},
ISSN={1745-1337},
month={December},}
Copy
TY - JOUR
TI - Performance Analysis of the Interval Algorithm for Random Number Generation in the Case of Markov Coin Tossing
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1325
EP - 1336
AU - Yasutada OOHAMA
PY - 2020
DO - 10.1587/transfun.2020TAP0008
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E103-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2020
AB - In this paper we analyze the interval algorithm for random number generation proposed by Han and Hoshi in the case of Markov coin tossing. Using the expression of real numbers on the interval [0,1), we first establish an explicit representation of the interval algorithm with the representation of real numbers on the interval [0,1) based one number systems. Next, using the expression of the interval algorithm, we give a rigorous analysis of the interval algorithm. We discuss the difference between the expected number of the coin tosses in the interval algorithm and their upper bound derived by Han and Hoshi and show that it can be characterized explicitly with the established expression of the interval algorithm.
ER -
English
