A strong converse for a collection of network source coding problems

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 2316-2320

  Gu, Wei Hsin ^a   Effros, Michelle ^a  

^a California Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK LENGTHS; FINITE ALPHABET; LOSSLESS SOURCE CODING; MULTICAST NETWORK; POINT-TO-POINT NETWORK; SIDE INFORMATION; SLEPIAN-WOLF; SOURCE-CODING; STRONG CONVERSE;

BLOCK CODES;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 70449516104     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205934     Document Type: Conference Paper

References (14)

1. I. Csiszár and J. Köner. Information Theory: Coding Theorems for Discrete Memoryless Systems. London, U.K.:Academic, 1981.
2. J. C. Kieffer. Strong converses in source coding relative to a fidelity criterion. IEEE Transactions on Information Theory, IT-37(2):257-262, March 1991.
3. J. C. Kieffer. Sample converses in source coding theory. IEEE Transactions on Information Theory, IT-37(2):263-268, March 1991.
4. T. S. Han. Information-Spectrum Method in Information Theory. Springer-Verlag New Yort, LLC, 2003.
5. W. Gu, M. Effros, and M. Bakshi. A continuity theory for lossless source coding over networks. Proceedings of the Allerton Conference on Communication, Control, and Computing, September 2008.
6. R. Ahlswede and J. Körner. Source coding with side information and a converse for degraded broadcast channels. IEEE Transactions on Information Theory, IT-21(6):629-637, November 1975.
7. R. M. Gray and A. D. Wyner. Source coding for a simple network. Bell System Technical Journal, 53(9):1681-1721, November 1974.
8. M. Bakshi and M. Effros. On achievable rates for multicast in the presence of side information. In Proceedings of the IEEE International Symposium on Information Theory, Toronto, Canada, July 2008.
9. T. Ho, M. Medard, R. Koetter, D. R. Karger, M. Effros, J. Shi, and B. Leong. A random linear network coding approach to multicast. IEEE Transactions on Information Theory, IT-52(10):4413-4430, October 2006.
10. D. Slepian and J. K. Wolf. Noiseless coding of correlated information sources. IEEE Transactions on Information Theory, IT-19:471-480, 1973.
11. R. Ahlswede, P. Gács, and J. Körner. Bounds on conditional probabilities with applications in multi-user communication. Probability Theory and Related Fields, 34(2):157-177, June 1976.
12. Y. Oohama and T. Han. Universal coding for the Slepian-wolf data compression system and the strong converse theorem. IEEE Transactions on Information Theory, IT-40(6):1908-1919, November 1994.
13. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley, 1991.
14. W. Gu. On Achievable Rate Regions for Source Coding over Networks. PhD thesis, California Institute of Technology, 2008.