The adversarial joint source-channel problem

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2012, Pages 2112-2116

  Kochman, Yuval ^a   Mazumdar, Arya ^b   Polyanskiy, Yury ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b USA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL ERROR; CODE DESIGNS; COVERING CODES; ERROR CORRECTING CODE; JOINT SOURCE CHANNEL; JOINT SOURCE-CHANNEL CODING; SEPARATION PRINCIPLE;

INFORMATION THEORY; STOCHASTIC MODELS;

SOURCE SEPARATION;

EID: 84867524683     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2012.6283735     Document Type: Conference Paper

References (14)

1. C. E. Shannon. A mathematical theory of communication. Bell Syst. Tech. J., 27:379-423 and 623-656, July/October 1948.
2. R.W. Hamming. Error detecting and error correcting codes. Bell System Technical Journal, 29(2):147-160, 1950.
3. C. E. Shannon. Coding theorems for a discrete source with a fidelity criterion. In 1959 IRE Nat. Conv. Rec., volume pt. 4, pages 142-163, 1959.
4. A. N. Kolmogorov and V. M. Tikhomirov. Theory of transmission of information. Amer. Math. Soc. Trans., 17:277-364, 1961.
5. I. Csiszár and J. Körner. Information Theory: Coding Theorems for Discrete Memoryless Systems. Academic, New York, 1981.
6. T. Berger. Rate-Distortion Theory: A Mathematical Basis for Data Compression. Prentice-Hall, Englewood Cliffs, NJ, 1971.
7. G. Cohen, I. Honkala, S. Litsyn, and A. Lobstein. Covering Codes. North-Holland, 1997.
8. R. McEliece, E. Rodemich, H. Rumsey, and L. Welch. New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities. IEEE Trans. Inf. Theory, 23(2):157-166, 1977.
9. F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes. North-Holland, 1997.
10. D. Wang, A. Ingber, and Y. Kochman. The dispersion of joint source-channel coding. In Proc. 2011 49th Allerton Conference, volume 49, Allerton Retreat Center, Monticello, IL, USA, September 2011.
11. M. Gastpar, B. Rimoldi, and M. Vetterli. To code, or not to code: Lossy source-channel communication revisited. IEEE Trans. Inf. Theory, 49(5):1147-1158, May 2003.
12. P. Elias. Error-correcting codes for list decoding. IEEE Trans. Inf. Theory, 37(1):5-12, 1991.
13. V. M. Blinovsky. Bounds for codes in the case of list decoding of finite volume. Prob. Peredachi Inform., 22(1):7-19, 1986.
14. V. Guruswami and S. Vadhan. A lower bound on list size for list decoding. IEEE Trans. Inf. Theory, 56(11):5681-5688, November 2010.