Next Article in Journal
Analyzing Information Distribution in Complex Systems
Previous Article in Journal
Parametric PET Image Reconstruction via Regional Spatial Bases and Pharmacokinetic Time Activity Model
Previous Article in Special Issue
Capacity Bounds on the Downlink of Symmetric, Multi-Relay, Single-Receiver C-RAN Networks
Open AccessFeature PaperArticle

Two-Party Zero-Error Function Computation with Asymmetric Priors

The Pennsylvania State University, University Park, PA 16802, USA
Raytheon BBN Technologies, Cambridge, MA 02138, USA
Army Research Laboratory, Adelphi, MD 20783, USA
Author to whom correspondence should be addressed.
Earlier versions of this work have partially appeared at the IEEE GlobalSIP Symposium on Network Theory, December 2013, IEEE Data Compression Conference (DCC’14), March 2014, and IEEE Data Compression Conference (DCC’16), March 2016.
Entropy 2017, 19(12), 635;
Received: 11 July 2017 / Revised: 25 October 2017 / Accepted: 13 November 2017 / Published: 23 November 2017
(This article belongs to the Special Issue Network Information Theory)
We consider a two party network where each party wishes to compute a function of two correlated sources. Each source is observed by one of the parties. The true joint distribution of the sources is known to one party. The other party, on the other hand, assumes a distribution for which the set of source pairs that have a positive probability is only a subset of those that may appear in the true distribution. In that sense, this party has only partial information about the true distribution from which the sources are generated. We study the impact of this asymmetry on the worst-case message length for zero-error function computation, by identifying the conditions under which reconciling the missing information prior to communication is better than not reconciling it but instead using an interactive protocol that ensures zero-error communication without reconciliation. Accordingly, we provide upper and lower bounds on the minimum worst-case message length for the communication strategies with and without reconciliation. Through specializing the proposed model to certain distribution classes, we show that partially reconciling the true distribution by allowing a certain degree of ambiguity can perform better than the strategies with perfect reconciliation as well as strategies that do not start with an explicit reconciliation step. As such, our results demonstrate a tradeoff between the reconciliation and communication rates, and that the worst-case message length is a result of the interplay between the two factors. View Full-Text
Keywords: data compression; function computation; partial information; characteristic graphs data compression; function computation; partial information; characteristic graphs
Show Figures

Figure 1

MDPI and ACS Style

Guler, B.; Yener, A.; Basu, P.; Swami, A. Two-Party Zero-Error Function Computation with Asymmetric Priors. Entropy 2017, 19, 635.

AMA Style

Guler B, Yener A, Basu P, Swami A. Two-Party Zero-Error Function Computation with Asymmetric Priors. Entropy. 2017; 19(12):635.

Chicago/Turabian Style

Guler, Basak; Yener, Aylin; Basu, Prithwish; Swami, Ananthram. 2017. "Two-Party Zero-Error Function Computation with Asymmetric Priors" Entropy 19, no. 12: 635.

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

Search more from Scilit
Back to TopTop