A Proof of the Data Compression Theorem of Slepian and Wolf for Ergodic Sources

IEEE Transactions on Information Theory

Volumn 21, Issue 2, 1975, Pages 226-228

  Cover, Thomas M ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

EID: 0016486048     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1975.1055356     Document Type: Article

References (8)

1. D. Slepian and J. Wolf. “Noiseless coding of correlated information sources,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 471–480, July 1973.
2. C. E. Shannon, “A mathematical theory of communication,” Bell Syst, Tech. vol. 27, pp, 379-123, 623-656, 1948.
3. B. McMillan, “The basic theorems of information theory,” Ann. math Statist., vol.24, pp: 196-219, 1953.
4. L. Brennan, “The individual ergocic theorem or information tneory, Ann. Math. Statist., vol. 28, pp. 809–811, 1957; correction, Ann. Math. Statist., vol. 31, pp. 809–810, 1960.
5. K. L. Chung, “A note on the ergodic theorem of information theory,” Ann. Math. Statist., vol. 32, pp. 612-614, 1961.
6. J. Wolf, “Data reduction for multiple correlated sources,” In Proc, 5th Colloquium Microwave Communication, 1974, pp. 287-295.
7. R. Ahlswede and J. Korner, “Source coding with side information and a converse for degraded broadcast channels,” unpublished paper, 1974.
8. T. M. Cover, “Some advances in broadcast channels,” to appear as ch, in Advances in Communication Theory, A. Viterbi, Ed. Englewood, N.J.: Prentice-Hall, 1975.