Source codes as random number generators

IEEE Transactions on Information Theory

Volumn 44, Issue 2, 1998, Pages 462-471

  Visweswariah, Karthik ^b   Kulkarni, Sanjeev R ^a,b   Verdú, Sergio ^b  

^a IEEE

^b Princeton University   (United States)

Author keywords

Data compression; Entropy; Lempel Ziv algorithm; Random number generation; Universal source coding

Indexed keywords

ALGORITHMS; DATA COMPRESSION; ENCODING (SYMBOLS); PROBABILITY; RANDOM NUMBER GENERATION;

ENTROPY RATE; LEMPEL-ZIV ALGORITHM; SOURCE CODES; UNIVERSAL SOURCE CODING;

CODES (SYMBOLS);

EID: 0032028938     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.661497     Document Type: Article

References (15)

1. R. Ahlswede, T. S. Han, and K. Kobayashi, "Universal coding of integers and unbounded search trees," IEEE Trans. Inform. Theory, vol. 43, pp. 669-682, Mar. 1997.
2. T. M. Cover and J. A. Thomas, Elements of Information Theory (Wiley Series in Telecommunications). New York: Wiley, 1991.
3. I. Csiszár, and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
4. P. Elias, "The efficient construction of an unbiased random sequence," Ann. Math. Statist., vol. 43, pp. 865-870, 1972.
5. T. S. Han and M. Hoshi, "Interval algorithm for random number generation," IEEE Trans. Inform. Theory, vol. 43, pp. 599-611, Mar. 1997.
6. W. Hoeffding and G. Simons, "Unbiased coin tossing with a biased coin," Ann. Math. Statist., vol 41, pp. 341-352, 1970.
7. Y. Peres, "Iterating von Neumann's procedure for generating random bits," Ann. Statist., vol. 20, no. 1, pp. 590-597, 1992.
8. R. Shack, "The length of a typical Huffman codeword," IEEE Trans. Inform. Theory, vol. 40, pp. 1246-1247, July 1994.
9. Q. Stout and B. Warren, "Three algorithms for unbiased coin tossing with a biased coin," Ann. Probab., vol. 12, pp. 212-222, 1984.
10. S. Vembu, "Information theory without ergodicity assumptions: Some new results," Ph.D. dissertation, Dept. Elec. Eng., Princeton Univ., Princeton, NJ, Mar. 1994.
11. S. Vembu and S. Verdú, "Generating random bits from an arbitrary source: Fundamental limits," IEEE Trans. Inform. Theory, vol. 41, pp. 1322-1332, Sept. 1995.
12. J. von Neumann, "Various techniques used in connection with random digits" Nat. Bur. Stand. Appl. Math. Ser., vol. 12, pp. 36-38, 1951.
13. Reprinted in Collected Works of von Neumann, vol. 5.
14. J. Ziv, "Coding theorems for individual sequences," IEEE Trans. Inform. Theory, vol. IT-24, pp. 389-394, July 1978.
15. _, "Compression, tests for randomness and estimating the statistical model of an individual sequence," Sequences: Combinatorics, Compression, Security, and Transmission, R. M. Capocelli, Ed. New York: Springer-Verlag, 1990.