Computing polynomial functions of correlated sources: Inner bounds

This paper considers the problem of source coding for computing functions of correlated i.i.d. random sources. The approach of combining standard and linear random coding for this problem was first introduced by Ahlswede and Han, in the special case of computing the modulo-two sum. In this paper, ma...

Full description

Saved in:
Bibliographic Details
Published in:2012 International Symposium on Information Theory and Its Applications pp. 160 - 164
Main Authors: Sheng Huang, Skoglund, M.
Format: Conference Proceeding
Language:English
Published: IEEE 01.10.2012
Subjects:
Decoding
Polynomials
Random variables
Source coding
Zinc
ISBN:9781467325219, 146732521X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper considers the problem of source coding for computing functions of correlated i.i.d. random sources. The approach of combining standard and linear random coding for this problem was first introduced by Ahlswede and Han, in the special case of computing the modulo-two sum. In this paper, making use of an adapted version of that method, we generalize their result to more sophisticated scenarios, where the functions to be computed are polynomial functions. Since all discrete functions are fundamentally restrictions of polynomial functions, our results are universally applied.
ISBN:9781467325219
146732521X
DOI:10.1109/ISIT.2012.6284664