Interval algorithm for random number generation

IEEE Transactions on Information Theory

Volumn 43, Issue 2, 1997, Pages 599-611

  Han, Te Sun ^a   Hoshi, Mamoru ^a  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

Arithmetic coding; Biased coin; Entropy; Interval algorithm; Partitions; Random number generation

Indexed keywords

MARKOV PROCESSES; PROBABILITY; RANDOM NUMBER GENERATION; RANDOM PROCESSES;

ARITHMETIC CODING; INTERVAL ALGORITHM;

ALGORITHMS;

EID: 0031103769     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.556116     Document Type: Article

References (24)

1. J. von Neumann, "Various techniques used in connection with random digits," Appl. Math. Ser., Notes by G. E. Forstyle, Nat. Bur. Stand., vol. 12, pp. 36-38, 1951.
2. W. Hoeffding and G. Simons, "Unbiased coin tossing with a biased coin," Ann. Math. Stat., vol. 41, pp. 341-352, 1970.
3. Q. Stout and B. Warren, "Three algorithms for unbiased coin tossing with a biased coin," Ann. Probab., vol. 12, pp. 212-222, 1984.
4. Y. Perez, "Iterating von Neumann's procedure for extracting random bits," Ann. Statist., vol. 21, no. 1, pp. 590-597, 1992.
5. P. Elias, "The efficient construction of an unbiased random sequences," Ann. Math. Statist., vol. 43, pp. 865-870, 1972.
6. M. Blum, "Independent unbiased coin flips from a correlated biased source - A finite state Markov chain," Combinatorica, vol. 6, no. 2, pp. 97-108, 1986.
7. D. Knuth and A. Yao, "The complexity of nonuniform random number generation," in Algorithms and Complexity, New Directions and Results, J. F. Traub, Ed. New York: Academic, 1976, pp. 357-428.
8. J. R. Roche, "Efficient generation of random variables from biased coins," Bell Tech. Rep., AT&T Lab., File case 20878, 1992.
9. J. Abrahams, "Generation of discrete distributions from biased coins," in Proc. Int. Symp. on Information Theory and its Applications, Nov. 1994, pp. 1181-1184.
10. T. S. Han and S. Verdú, "Approximation theory of output statistics," IEEE Trans. Inform. Theory, vol. 39, pp. 752-772, 1993.
11. S. Vembu and S. Verdú, "Generating random bits from an arbitrary source: Fundamental limits," IEEE Trans. Inform. Theory, vol. 41, no. 5, pp. 1322-1332, Sept. 1995.
12. M. S. Keane and M. Smorodinsky, "A class of finitary codes," Israel J. Math., vol. 26, pp. 352-371, 1977.
13. _, "Bernoulli schemes of the same entropy are finitarily isomorphic," Ann. Math., vol. 109, pp. 397-406, 1979.
14. _, "Finitary isomorphisms of irreducible Markov shifts," Israel J. Math., vol. 34, pp. 281-286, 1979.
15. M. S. Keane, "Ergodic theory and subshifts of finite type," in Ergodic Theory, Symbolic Dynamics and Hyperbolic Spaces, T. Bedford, M. Keane, C. Series, Eds. Oxford, U.K.: Oxford Univ. Press, 1991, pp. 35-70.
16. R. Ahlswede and I. Wegener, Search Problems. New York: Wiley, 1987.
17. T. M. Cover and J. A. Thomas, Elements of Information Thoery. New York: Wiley, 1991.
18. C. E. Shannon, "Prediction and entropy of printed English," Bell Syst. Tech. J., vol. 27, pp. 379-423, 1948.
19. R. F. Muirhead, "Some methods applicable to identities and inequalities of the symmetric algebraic functions of n letters," in Proc. Edinburgh Math. Soc., vol. 21, pp. 144-157, 1903.
20. I. Schur, "Über ein Klasse von Mittelbildungen mit Anwendungen auf die Determinatentheorie," Sitzungsberichte Berliner Math. Ges., vol. 22, pp. 9-20, 1923.
21. A. W. Marshall, I. Olkin, and F. Proschan, "Monotonicity of ratios of means and other applications of majorization," in Inequalities, O. Shisha, Ed. New York: Academic, 1967, pp. 177-190.
22. J. Abrahams and M. J. Lipman, "Relative uniformity of sources and the comparison of optimal code costs," IEEE Trans. Inform. Theory, vol. 39, no. 5, pp. 1695-1697, Sept. 1993.
23. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
24. J. Rissanen and G. G. Langdon, "Arithmetic coding," IBM J. Res. Devel., vol. 23, pp. 149-169, 1979.