Log In Sign Up

Coding for Computing Arbitrary Functions Unknown to the Encoder

by   Sourya Basu, et al.

In this paper we consider point-to-point and distributed source coding problems where the receiver is only interested in a function of the data sent by the source encoder(s), while knowledge of the function remains unknown to the encoder(s). We find the rate region for these problems, and in particular, show that if the destination is interested in computing a non-bijective function then the rate region for the point-to-point source coding problem expands over the entropy, and the rate region over the distributed source coding problem expands over the Slepian-Wolf rate region. A novel proof technique, similar to random binning, is developed to prove these results.


page 1

page 2

page 3

page 4


Coding Theorems for Asynchronous Slepian-Wolf Coding Systems

The Slepian-Wolf (SW) coding system is a source coding system with two e...

Lossy Computing with Side Information via Multi-Hypergraphs

We consider a problem of coding for computing, where the decoder wishes ...

Computing the Rate-Distortion Function of Gray-Wyner System

In this paper, the rate-distortion theory of Gray-Wyner lossy source cod...

The Price of Distributed: Rate Loss in the CEO Problem

In the distributed remote (CEO) source coding problem, many separate enc...

A Unified Framework for Problems on Guessing, Source Coding and Task Partitioning

We study four problems namely, Campbell's source coding problem, Arikan'...

The Explicit Coding Rate Region of Symmetric Multilevel Diversity Coding

It is well known that superposition coding, namely separately encoding ...

A few brief notes on the equivalence of two expressions for statistical significance in point source detections

The problem of point source detection in Poisson-limited count maps has ...