Efficient generation of fair dice with few biased coins

IEEE Transactions on Information Theory

Volumn 45, Issue 5, 1999, Pages 1600-1606

  Gargano, Luisa ^a   Vaccaro, Ugo ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; INFORMATION THEORY; OPTIMIZATION; PROBABILITY; RANDOM NUMBER GENERATION; RANDOM PROCESSES;

BIASED COINS; RANDOMIZED ALGORITHMS;

ALGORITHMS;

EID: 0032629304     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.771228     Document Type: Article

References (18)

1. J. Abrahams, "Generation of discrete distributions from biased coins," IEEE Trans. Inform. Theory, vol. 42, pp. 1541-1546, 1996.
2. 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.
3. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
4. E. W. Dijkstra, "Making a fair roulette from a possibly biased coin," Inform. Processing Lett., vol. 36, p. 193, 1990.
5. P. Elias, "The efficient computation of an unbiased random sequence," Ann. Math. Statist., vol. 43, pp. 865-870, 1972.
6. D. Feldman, R. Impagliazzo, M. Naor, N. Nisan, S. Rudich, and A. Shamir, "On dice and coins: Models of computation for random generation," Inform. Comput., vol. 104, pp. 159-174, 1993.
7. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
8. W. Hoeffding and G. Simons, "Unbiased coin tossing with a biased coin," Ann. Math. Statist., vol. 41, pp. 341-352, 1970.
9. T. S. Han and M. Hoshi, "Interval algorithm for random number generation," IEEE Trans. Inform. Theory, vol. 43, pp. 599-611, 1997.
10. Y. Horibe, "Entropy and optimal random number transformation," IEEE Trans. Inform. Theory, vol. IT-27, pp. 527-529, 1981.
11. D. A. Huffman, "A method for the construction of minimum redundancy codes," Proc. IRE, vol. 40, pp. 1098-1101, Feb. 1952.
12. T. Itoh, "Simulating fair dice with biased coins," Inform. Comput., vol. 126, pp. 78-82, 1996.
13. D. E. Knuth and A. C. 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-328.
14. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1996.
15. J. R. Roche, "Efficient generation of random variables from biased coins," Bell Tech. Rep., AT&T Lab., File Case 20878, 1992.
16. Q. F. Stout and B. Warren, "Tree algorithms for unbiased coin tossing with a biased coin," Ann. Probab., vol. 12, pp. 212-222, 1984.
17. J. von Neumann, "Various techniques used in connection with random digits, notes by G. E. Forsythe, National Bureau of Standards," Applied Math Ser., vol. 12, pp. 36-38;
18. reprinted in von Neumann's Collected Works., vol. 5. Oxford, U.K.: Pergamon, 1963, pp. 768-770.