DocumentCode
1779675
Title
An achievable rate-distortion region for the multiple descriptions problem
Author
Shirani, Farhad ; Pradhan, S. Sandeep
Author_Institution
EECS Dept., Univ. of Michigan, Ann Arbor, MI, USA
fYear
2014
fDate
June 29 2014-July 4 2014
Firstpage
576
Lastpage
580
Abstract
A multiple-descriptions (MD) coding strategy is proposed and an inner bound to the achievable rate-distortion region is derived for discrete memoryless sources. The scheme utilizes linear codes. It is shown in two different MD set-ups that the linear coding scheme achieves a larger rate-distortion region than previously known random coding strategies. Furthermore, it is shown via an example that the best known random coding scheme for the set-up can be improved by including additional randomly generated codebooks.
Keywords
encoding; linear codes; random codes; rate distortion theory; discrete memoryless sources; linear codes; multiple descriptions coding strategy; random coding; randomly generated codebooks; rate distortion region; Decoding; Linear codes; Random variables; Rate-distortion; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory (ISIT), 2014 IEEE International Symposium on
Conference_Location
Honolulu, HI
Type
conf
DOI
10.1109/ISIT.2014.6874898
Filename
6874898
Link To Document