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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2012 International Symposium on Information Theory and Its Applications S. 160 - 164
Hauptverfasser: Sheng Huang, Skoglund, M.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.10.2012
Schlagworte:
Decoding
Polynomials
Random variables
Source coding
Zinc
ISBN:9781467325219, 146732521X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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