Computing polynomial functions of correlated sources: Inner bounds
2012 (English)In: 2012 International Symposium on Information Theory and its Applications (ISITA), IEEE conference proceedings, 2012, 160-164 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
IEEE conference proceedings, 2012. 160-164 p.
Decoding, Polynomials, Random variables, Source coding, Standards, Zinc
IdentifiersURN: urn:nbn:se:kth:diva-109293ISI: 000320850700034ScopusID: 2-s2.0-84873540190ISBN: 978-1-4673-2521-9OAI: oai:DiVA.org:kth-109293DiVA: diva2:581175
2012 International Symposium on Information Theory and its Applications, Honolulu, Hawaii, USA, October 28-31, 2012
FunderSwedish Research CouncilICT - The Next Generation
QC 201301092013-01-102012-12-282013-08-13Bibliographically approved