Achievable error exponents in multiterminal source coding

Encoding correlated sources at separate encoders has been studied extensively from the perspective of asymptotically long block codes. The associated error exponents are known for the case of lossless source coding. In this paper, we introduce a novel technique for deriving achievable error exponents for lossy source coding problems, where the original sources need to be reconstructed to within some fidelity. its an example, we show how to apply our technique to determine achievable error exponents for the Berger-Yeung problem.


Published in:
2006 40th Annual Conference on Information Sciences and Systems, Vols 1-4, 1146-1151
Presented at:
40th Annual Conference on Information Sciences and Systems (CISS), Princeton, NJ, Mar 22-24, 2006
Year:
2006
Publisher:
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa
ISBN:
1-4244-0349-9
Keywords:
Laboratories:




 Record created 2011-10-17, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)