Source code with cost as a nonuniform random number generator

IEEE Transactions on Information Theory

Volumn 46, Issue 2, 2000, Pages 712-717

  Sun Han, Te ^a,b   Uchida, Osamu ^b  

^a IEEE

^b UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); RANDOM NUMBER GENERATION; RANDOM PROCESSES;

COST FUNCTION; SOURCE CODE;

SIGNAL ENCODING;

EID: 0033873301     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.825849     Document Type: Article

References (10)

1. J. von Neumann, "Various techniques used in connection with random digits," in Applied Mathematics Series. Notes by G. E. Forstyle, Wshington, DC: Nat. Bur. Stand., 1951, vol. 12, pp. 36-38.
2. P. Elias, "The efficient construction of an unbiased random sequences," in Ann. Math. Statist., 1972, vol. 43, pp. 865-870.
3. 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.
4. K. Visweswariah, S. R. Kulkarni, and S. Verdú, "Source codes as random number generators," IEEE Trans. Inform. Theory, vol. 44, pp. 462-471, Mar. 1998.
5. T. S. Han, Information-Spectrum Methods in Information Theory (in Japanese). Tokyo: Baifukan, 1998.
6. R. M. Karp, "Minimum redundancy coding for the discrete noiseless channel," IRE Trans. Inform. Theory, vol. IT-7, pp. 27-38, Jan. 1961.
7. K. Iwata, M. Morii, and T. Uyematsu, "An efficient universal coding algorithm for noiseless channel with symbols of unequal cost," IEICE Trans. Fundamentals, vol. E80-A, no. 11, pp. 2232-2237, Nov. 1997.
8. R. M. Krause, "Channels which transmit letters of unequal duration," Inform. Control, vol. 5, pp. 13-24, 1962.
9. I. Csiszár and J. Körner, Information Theory, Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
10. T. S. Han, Theorems on the variable-length intrinsic randomness, to be published.