Randomizing functions: Simulation of a discrete probability distribution using a source of unknown distribution

IEEE Transactions on Information Theory

Volumn 52, Issue 11, 2006, Pages 4965-4976

  Pae, Sung Il ^a,b   Loui, Michael C ^c  

^a University of Illinois at Urbana Champaign   (United States)

^b Korea Institute for Advanced Study   (South Korea)

^c United States of America   (United States)

Author keywords

Coin flipping; Random number generation; Randomizing function; Universal coding

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; ENCODING (SYMBOLS); PROBABILITY DISTRIBUTIONS; RANDOM NUMBER GENERATION; RANDOM PROCESSES;

COIN FLIPPING; RANDOMIZING FUNCTION; UNIVERSAL CODING; UNKNOWN DISTRIBUTION;

INFORMATION THEORY;

EID: 33750588458     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.883555     Document Type: Article

References (24)

1. P. Diaconis, S. Holmes, and R. Montgomery, "Dynamical Bias in the Coin Toss," Persi Diaconis's Home Page Online. Available: http://www-stat.stanford.edu/~cgates/PERSI/, to be published
2. B. A. Cipra, "Tossed coins and troubled marriages: Mathematical highlights from AAAS 2004," SIAM News, vol. 37, no. 4, May 2004.
3. E. Klarreich, "Toss out the toss-up: Bias in heads-or-tails," Sci. News, vol. 165, pp. 131-132, 2004.
4. J. von Neumann, "Various techniques for use in connection with random digits. Notes by G. E. Forsythe," in Appl. Math., ser. Monte Carlo Method. Washington, DC: U.S. National Bureau of Standards, 1951, vol. 12, pp. 36-38.
5. Y. Peres, "Iterating von Neumann's procedure for extracting random bits," Ann. Stat., vol. 20, no. 1, pp. 590-597, 1992.
6. P. Elias, "The efficient construction of an unbiased random sequence," Ann. Math. Stat., vol. 43, no. 3, pp. 865-870, 1972.
7. D. E. Knuth and A. C.-C. Yao, J. F. Traub, Ed., "The complexity of nonuniform random number generation," in Proc. Algorithms and Complexity: New Directions and Recent Results, New York, NY, 1976, pp. 357-428.
8. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991, Wiley Series in Telecommunications.
9. J. R. Roche, Efficient Generation of Random Variables From Biased Coins, Tech. Rep.AT&T Lab., Bell Tech. Report File case 20878, 1992.
10. T. S. Han and M. Hoshi, "Interval algorithm for random number generation," IEEE Trans. Inf. Theory, vol. 43, pp. 599-611, 1997.
11. J. L. Massey, "The entropy of a rooted tree with probabilities," in Proc. 1983 IEEE Int. Symp. Inf. Theory, 1983.
12. W. Hoeffding and G. Simons, "Unbiased coin tossing with a biased coin," Ann. Math. Stat., vol. 41, pp. 341-352, 1970.
13. Q. F. Stout and B. Warren, "Tree algorithms for unbiased coin tossing with a biased coin," Ann. Prob., vol. 12, no. 1, pp. 212-222, 1984.
14. A. Juels, M. Jakobsson, E. Shriver, and B. K. Hillyer, "How to turn loaded dice into fair coins," IEEE Trans. Inf. Theory, vol. 46, pp. 911-921, 2000.
15. J. Abrahams, "Code and parse trees for lossless source encoding," Commun. Inf. Syst., vol. 1, no. 2, pp. 113-146, 2001.
16. S. Pae and M. C. Loui, "Optimal random number generation from a biased coin," in Proc. Sixteenth Annu. ACM-SIAM Symp. Discrete Algorithms, Jan. 2005, pp. 1079-1088.
17. S. Pae, "Random number generation using a biased source," Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Tech. Rep. UILU-ENG-05-211, CRHC-05-03, May 2005.
18. E. W. Dijkstra, "Making a fair roulette from a possibly biased coin," Inf. Process. Lett., vol. 36, p. 193, 1990.
19. T. M. Cover, "Enumerative source encoding," IEEE Trans. Inf. Theory, vol. 19, pp. 73-77, Jan. 1973.
20. J. P. M. Schalkwijk, "An algorithm for source coding," IEEE Trans. Inf. Theory, vol. 18, pp. 395-399, May 1972.
21. D. Knuth, The Art of Computer Programming. Reading, MA: Addison-Wesley, 2005, vol. 4, Pascicle 3, Generating all combinations and partitions.
22. B. Y. Ryabko and E. Matchikina, "Fast and efficient construction of an unbiased random sequence," IEEE Trans. Inf. Theory, vol. 46, pp. 1090-1093, 2000.
23. A. Schonhage and V. Strassen, "Schnelle multiplikation grosser zahlen," Computing, vol. 7, pp. 281-292, 1971.
24. J. C. Lawrence, "A new universal coding scheme for the binary memoryless source," IEEE Trans. Inf. Theory, vol. 23, pp. 466-472, Jul. 1977.