Polynomials and computing functions of correlated sources
2012 (English)In: Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on, IEEE , 2012, 771-775 p.Conference paper (Refereed)
We consider the source coding problem of computing functions of correlated sources, which is an extension of the Slepian - Wolf coding problem. We observe that all the discrete functions are in fact restrictions of polynomial functions over some finite field. Based on this observation, we demonstrate how to use Elias' Lemma to enlarge the coding rate region (compared to the Slepian - Wolf region) for a certain class of polynomial functions. We present a classification result about polynomial functions regarding this coding problem. The result is conclusive in the two-sources scenario and, in fact, gives another interpretation of a result by Han and Kobayashi [1, Theorem 1].
Place, publisher, year, edition, pages
IEEE , 2012. 771-775 p.
, IEEE International Symposium on Information Theory - Proceedings
Classification results, Coding problems, Coding rate, Computing functions, Correlated sources, Discrete functions, Finite fields, Polynomial functions, Source-coding, Two sources
Engineering and Technology
IdentifiersURN: urn:nbn:se:kth:diva-104968DOI: 10.1109/ISIT.2012.6284664ISI: 000312544300157ScopusID: 2-s2.0-84867503018ISBN: 978-146732579-0OAI: oai:DiVA.org:kth-104968DiVA: diva2:567986
2012 IEEE International Symposium on Information Theory, ISIT 2012, 1 July 2012 through 6 July 2012, Cambridge, MA
FunderICT - The Next Generation
QC 201211152012-11-152012-11-142013-04-15Bibliographically approved