Folklore in source coding: Information-spectrum approach

IEEE Transactions on Information Theory

Volumn 51, Issue 2, 2005, Pages 747-753

  Han, Te Sun ^a  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

Almost completely random; Data compression; Folklore; Information spectrum; Intrinsic randomness; Random number generation

Indexed keywords

DATA COMPRESSION; ERROR ANALYSIS; INFORMATION THEORY; PROBABILITY DISTRIBUTIONS; RANDOM NUMBER GENERATION; RANDOM PROCESSES;

ALMOST COMPLETELY RANDOM; FOLKLORE PROBLEMS; INFORMATION SPECTRUM; INTRINSIC RANDOMNESS;

ENCODING (SYMBOLS);

EID: 13444270764     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.840860     Document Type: Article

References (7)

1. T. S. Han and S. Verdú, "Approximation theory of output statistics," IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 752-772, May 1993.
2. L. Breiman, "The individual ergodic theorem of information theory," Ann. Math. Statist., vol. 28, pp. 809-811, 1957.
3. A. R. Barron, "The strong ergodic theorem for densities: Generalized Shannon-Mcmillan-Breiman theorem," Ann. Probab., vol. 13, no. 4, pp. 1292-1303, 1985.
4. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
5. T. S. Han, Information-Spectrum Methods in Information Theory. Berlin, Germany: Springer-Verlag, 2002.
6. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
7. S. Vembu and S. Verdú, "Generating random bits from an arbitrary source: Fundamental limits," IEEE Trans. Inf. Theory, vol. 41, no. 5, pp. 1322-1332, Sept. 1995.