Universal coding for the Slepian-Wolf data compression system and the strong converse theorem
- 1 January 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 40 (6) , 1908-1919
- https://doi.org/10.1109/18.340465
Abstract
Universal coding for the Slepian-Wolf (1973) data compression system is considered. We shall demonstrate based on a simple observation that the error exponent given by Csiszar and Korner (1980) for the universal coding system can strictly be sharpened in general for a region of relatively higher rates. This kind of observation can be carried over also to the case of lower rates outside the Slepian-Wolf region, which establishes the strong converse along with the optimal exponentKeywords
This publication has 5 references indexed in Scilit:
- Linear codes for sources and source networks: Error exponents, universal codingIEEE Transactions on Information Theory, 1982
- Towards a general theory of source networksIEEE Transactions on Information Theory, 1980
- Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)IEEE Transactions on Information Theory, 1979
- Noiseless coding of correlated information sourcesIEEE Transactions on Information Theory, 1973
- On the converse to the coding theorem for discrete memoryless channels (Corresp.)IEEE Transactions on Information Theory, 1973