Sciweavers

Share
TIT
1998

Source Codes as Random Number Generators

8 years 11 months ago
Source Codes as Random Number Generators
—A random number generator generates fair coin flips by processing deterministically an arbitrary source of nonideal randomness. An optimal random number generator generates asymptotically fair coin flips from a stationary ergodic source at a rate of bits per source symbol equal to the entropy rate of the source. Since optimal noiseless data compression codes produce incompressible outputs, it is natural to investigate their capabilities as optimal random number generators. In this paper we show under general conditions that optimal variable-length source codes asymptotically achieve optimal variable-length random bit generation in a rather strong sense. In particular, we show in what sense the Lempel–Ziv algorithm can be considered an optimal universal random bit generator from arbitrary stationary ergodic random sources with unknown distributions.
Karthik Visweswariah, Sanjeev R. Kulkarni, Sergio
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 1998
Where TIT
Authors Karthik Visweswariah, Sanjeev R. Kulkarni, Sergio Verdú
Comments (0)
books