DocumentCode :
3284843
Title :
Achievable Error Exponents in Multiterminal Source Coding
Author :
Eswaran, Krishnan ; Gastpar, Michael
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA
fYear :
2006
fDate :
22-24 March 2006
Firstpage :
1146
Lastpage :
1151
Abstract :
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. As an example, we show how to apply our technique to determine achievable error exponents for the Berger-Yeung problem.
Keywords :
block codes; correlation methods; source coding; achievable error exponents; block codes; multiterminal source coding; source correlation; Block codes; Computer errors; Convergence; Decoding; Delay; Electronic mail; Encoding; Quantization; Random variables; Source coding;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Sciences and Systems, 2006 40th Annual Conference on
Conference_Location :
Princeton, NJ
Print_ISBN :
1-4244-0349-9
Electronic_ISBN :
1-4244-0350-2
Type :
conf
DOI :
10.1109/CISS.2006.286638
Filename :
4067979
Link To Document :
بازگشت