Generation of discrete distributions from biased coins

IEEE Transactions on Information Theory

Volumn 42, Issue 5, 1996, Pages 1541-1546

  Abrahams, Julia ^a,b  

^a IEEE

^b OFFICE OF NAVAL RESEARCH   (United States)

Author keywords

Biased coins; Random number generation; t ary expansions; Unequal code symbol costs

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; ENCODING (SYMBOLS); OPTIMIZATION; PROBABILITY; RANDOM NUMBER GENERATION; RANDOM PROCESSES;

ARITHMETIC CODING PERSPECTIVE; DISCRETE DISTRIBUTIONS;

INFORMATION THEORY;

EID: 0030244011     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.532895     Document Type: Article

References (12)

1. J. Abrahams and M. J. Lipman, "Zero-redundancy coding for unequal code symbol costs," IEEE Trans. Inform. Theory, vol. 38, pp. 1583-1586, 1992.
2. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
3. L. C. Eggan and C. L. Vanden Eynden, " 'Decimal' expansions to nonintegral bases," Amer. Math. Monthly, vol. 73, pp. 576-582, 1966.
4. C. G. Gunther, "Homophonic coding - A transform for flat probability distributions," F&T Dig., pp. 2-3, Jan. 1992.
5. T. S. Han and M. Hoshi, "Interval algorithm for random number generation," IEEE Trans. Inform. Theory, submitted for publication, preprint, Mar. 17, 1995.
6. Y. Horibe, "Entropy and an optimal random number transformation," IEEE Trans. Inform. Theory, vol. IT-27, no. 4, pp. 527-529, July 1981.
7. H. N. Jendal, Y. J. D. Kuhn, and J. L. Massey, "An information-theoretic treatment of homophonic substitution," in Advances in Cryptology - EUROCRYPT'S9 (Lecture Notes in Computer Science, vol. 434, J.-J. Quisquater and J. Vanderwalle, Eds.) New York: Springer-Verlag, 1990, pp. 382-394.
8. R. M. Karp, "Minimum-redundancy coding for the discrete noiseless channel," IRE Trans. Inform. Theory, vol. IT-7, pp. 27-38, Jan. 1961.
9. D. E. Knuth and A. C. Yao, "The complexity of nonuniform random number generation," in Algorithms and Complexity: New Directions and Recent Results, J. F. Traub, Ed. (Proc. Symp. held by the Comp. Sci. Dept., Carnegie-Mellon Univ., Pittsburgh, PA, Apr. 7-9, 1976.) New York: Academic Press, 1976, pp. 357-428.
10. J. R. Roche, "Efficient generation of random variables from biased coins," in Proc. IEEE Int. Symp. on Information Theory (Budapest, Hungary, 1991), p. 169,
11. and AT&T Bell Lab. Tech. Memo., Sept. 21, 1992.
12. Q. F. Stout and B. Warren, "Tree algorithms for unbiased coin tossing with a biased coin," Ann. Probab., vol. 12, pp. 212-222, 1984.