An achievable rate region for distributed source coding with reconstruction of an arbitrary function of the sources

Author

Krithivasan, Dinesh ; Pradhan, S. Sandeep

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., Univ. of Michigan, Ann Arbor, MI

fYear

2008

fDate

6-11 July 2008

Firstpage

56

Lastpage

60

Abstract

A new rate region is presented for a general framework of distributed source coding where the decoder is interested in lossy reconstruction of an arbitrary function of the sources. The coding scheme involves vector quantization of the sources followed by "correlated" binning. Nested linear codes are used for quantization and binning as against the more prevalent random codes. Our rate region recovers many known rate regions in distributed source coding while unifying them under the same general framework.

Keywords

linear codes; random codes; source coding; vector quantisation; correlated binning; distributed source coding; nested linear codes; random codes; vector quantization; Decoding; Distortion measurement; Distributed computing; Encoding; Engineering profession; Information theory; Linear code; Random variables; Source coding; Vector quantization;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2008. ISIT 2008. IEEE International Symposium on

Conference_Location

Toronto, ON

Print_ISBN

978-1-4244-2256-2

Electronic_ISBN

978-1-4244-2257-9

Type

conf

DOI

10.1109/ISIT.2008.4594947

Filename

4594947