Achievable Error Exponents in Multiterminal Source Coding

K. Eswaran and M. Gastpar

Proceedings of the 40th Conference on Information Sciences and Systems (CISS 2006), Princeton, NJ, March 2006.

Download

Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

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.

Notes

Links

Krishnan Eswaran's homepage

Michael Gastpar's homepage

SIPC group page

Reference

K. Eswaran and M. Gastpar, Achievable Error Exponents in Multiterminal Source Coding. Proceedings of the 40th Conference on Information Sciences and Systems (CISS 2006), Princeton, NJ, March 2006.

BibTeX

@INPROCEEDINGS(ke_mg_ciss06,
   AUTHOR = "K.~Eswaran and M.~Gastpar",
   TITLE = "Achievable Error Exponents in Multiterminal Source Coding",
   BOOKTITLE = "Proceedings of the 40th Conference on Information Sciences and Systems (CISS 2006)",
   MONTH = "March",
   ADDRESS = "Princeton, NJ",
   YEAR = "2006")