Some fundamental coding theoretic limits of unequal error protection

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 2231-2235

  Borade, Shashi ^a   Sanghavi, Sujay ^b  

^a Purdue University ^*

^b PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CHANNELS; ERROR EXPONENT; GILBERT-VARSHAMOV BOUND; INFORMATION-THEORETIC LIMITS; MINIMUM DISTANCE; NON-BINARY; SINGLETON BOUND; SUCCESSIVE REFINEMENT; THEORETIC LIMIT; UNEQUAL ERROR PROTECTIONS; UPPER BOUND;

BINARY CODES; HAMMING DISTANCE;

INFORMATION THEORY;

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

References (6)

1. S. Borade, B. Nakiboglu, L. Zheng, "Some fundamental limits of unequal error protection," IEEE International Symposium on Information Theory, Toronto, pp. 2222-2226, July 2008.
2. S. Borade, "When all information is not created equal," Ph.D. Theis, Massachusetts Institute of Technology, Sept. 2008.
3. L. Bassalygo, V. Zinovev, V. Zyablov, M. Pinsker, G. Poltyrev, "Bounds for codes with unequal protection of two sets of messages," Problems of Information Transmission, vol. 15, no. 3, pp. 190197, 1980.
4. I. Csiszar and J. Komer, Information Theory: Coding Theorems for Discrete Memoryless Systems, Academic Press, New York, 1981.
5. M. Talagrand, "Concentration of measure and isoperimetric inequalities in product spaces," Publ. IHES 81, pp. 73-205, 1995.
6. R. Roth, Introduction to Coding Theory, Cambridge University Press, 2006.