Bounds on the achievable region for certain multiple description coding problems

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2001, Pages 148-

  Venkataramani, Raman ^a   Kramer, Gerhard ^b   Goyal, Vivek K ^c  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c Digital Fountain Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACHIEVABLE REGION; MULTIPLE DESCRIPTION CODING PROBLEM; RATE-DISTORTION REGION;

COMMUNICATION CHANNELS (INFORMATION THEORY); ENCODING (SYMBOLS); ERRORS; SIGNAL DISTORTION; THEOREM PROVING;

CHANNEL CAPACITY;

EID: 0034873495     PISSN: 21578095     EISSN: None     Source Type: Journal    
DOI: 10.1109/ISIT.2001.936011     Document Type: Article

References (3)

1. New results in binary multiple descriptions
2. Achievable rates for multiple descriptions
3. On a source coding problem with two channels and three receivers