Block coding for an ergodic source relative to a zero-one valued fidelity criterion
- 1 July 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 24 (4) , 432-438
- https://doi.org/10.1109/tit.1978.1055914
Abstract
An effective rate for block coding of a stationary ergodic source relative to a zero-one valued fidelity criterion is defined. Under some mild restrictions, a source coding theorem and converse are given that show that the defined rate is optimum. Several examples are given that satisfy the restrictions imposed. A new generalization of the Shannon-McMman Theorem is employed.Keywords
This publication has 5 references indexed in Scilit:
- A note on the abstract alphabet block source coding with a fidelity criterion theorem (Corresp.)IEEE Transactions on Information Theory, 1978
- Variable-rate, weakly- and strongly-universal source coding subject to a fidelity constraint (Ph.D. Thesis abstr.)IEEE Transactions on Information Theory, 1977
- A Counterexample to Perez's Generalization of the Shannon-McMillan TheoremThe Annals of Probability, 1973
- Epsilon Entropy and Data CompressionThe Annals of Mathematical Statistics, 1971
- Contributions to information theory for abstract alphabetsArkiv för Matematik, 1961