Abstract
The problem of constructing efficient methods for generating uniformly distributed random numbers from nonuniformly distributed ones with a given arbitrarily small error is considered. An estimate of the complexity of these methods is given as a function of the error, which is measured as the deviation of numbers generated from uniformly distributed. Methods whose complexity is lower in order than that of known methods are proposed.
Similar content being viewed by others
REFERENCES
von Neumann, J., Various Techniques Used in Connection with Random Digits, Monte Carlo Method, Applied Mathematics Series, Washington: National Bureau of Standards, 1951, no. 12, pp. 36-38.
Elias, P., The Effcient Construction of an Unbiased Random Sequence, Ann. Math. Stat., 1972, vol. 43, no. 3, pp. 864-870.
Ryabko, B. and Matchikina E., Fast and Efficient Construction for Unbiased Random Sequence, IEEE Trans. Inf. Theory, 2000, vol. 46, no. 3, pp. 1090-1093.
Peres, Y., Iterating von Neumann's Procedure for Extracting Random Bits, Ann. Stat., 1992, vol. 20, no. 1, pp. 590-597.
Blum, M., Independent Unbiased Coin Flips from a Correlated Biased Source?A Finite State Markov Chain, Combinatorica, 1986, vol. 6, no. 2, pp. 97-108.
Han, S. and Hoshi, M., Interval Algorithm for Random Number Generation, IEEE Trans. Inf. Theory, 1997, vol. 43, no. 2, pp. 599-611.
Ryabko, B.Ya. and Fionov, A.N., Efficient Homophonic Coding, IEEE Trans. Inf. Theory, 1999, vol. 45, no. 6, pp. 2083-2091.
Vembu, S. and Verdú, S., Generating Random Bits from Arbitrary Source: Fundamental Limits, IEEE Trans. Inf. Theory, 1995, vol. 41, no. 5, pp. 1322-1332.
Han, S. and Verdú, S., Approximation Theory of Output Statistics, IEEE Trans. Inf. Theory, 1993, vol. 39, no. 3, pp. 752-772.
Juels, A., Jakobsson, M., Shriver, E., and Hillyer, B.K., How to Turn Loaded Duce into Fair Coins, IEEE Trans. Inf. Theory, 2000, vol. 46, no. 3, pp. 911-922.
Han, S. and Hoshi, M., Interval Algorithm for Homophonic Coding, IEEE Trans. Inf. Theory, 2001, vol. 47, no. 3, pp. 1021-1032.
Aho, A.V., Hopcroft, J.E., and Ullman, J.D., The Design and Analysis of Computer Algorithms, Reading, Massachusetts: Addison-Wesley, 1976. Translated under the title Postroenie i analiz vychislitel'nykh algoritmov, Moscow: Mir, 1979.
Ryabko, B.Ya. and Fionov, A.N., Effcient Method of Adaptive Arithmetic Coding for Sources with Large Alphabets, Probl. Peredachi Inf., 1999, vol. 35, no. 4, pp. 95-108 [Probl. Inf. Trans. (Engl. Transl.), 1999, vol. 35, no. 4, pp. 369-380].
Pinsker, M.S., Informatsiya i informatsionnaya ustoichivost'sluchainykh velichin i protsessov, Probl. Peredachi Inf., issue 7, Moscow: Akad. Nauk SSSR, 1960. Translated under the title Information and Information Stability of Random Variables and Processes, San Francisco: Holden-Day, 1964.
Gray, R.M., Neuhoff, D.L., and Shields, P.C., A Generalization of Ornstein's Distance with Applications to Information Theory, Ann. Prob., 1975, vol. 3, pp. 515-528.
Rights and permissions
About this article
Cite this article
Ryabko, B.Y., Matchikina, E.P. An Efficient Generation Method for Uniformly Distributed Random Numbers. Problems of Information Transmission 38, 20–25 (2002). https://doi.org/10.1023/A:1020086005055
Issue Date:
DOI: https://doi.org/10.1023/A:1020086005055