Random coding strategies for minimum entropy
- 1 July 1975
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 21 (4) , 388-391
- https://doi.org/10.1109/tit.1975.1055416
Abstract
This paper proves that there exists a fixed random coding Strategy for block coding a memoryless information source to achieve the absolute epsilon entropy of the source. That is, the strategy can be chosen independent of the block length. The principal new tool is an easy result on the semicontinuity of the relative entropy functional of one probability distribution with respect to another. The theorem generalizes a result from rate-distortion theory to the "zero-infinity" case.Keywords
This publication has 4 references indexed in Scilit:
- Hiding and Covering in a Compact Metric SpaceThe Annals of Statistics, 1973
- Epsilon Entropy and Data CompressionThe Annals of Mathematical Statistics, 1971
- Epsilon Entropy of Stochastic ProcessesThe Annals of Mathematical Statistics, 1967
- Convergence of Random Processes and Limit Theorems in Probability TheoryTheory of Probability and Its Applications, 1956