
Coding Theorems for Asynchronous SlepianWolf Coding Systems
The SlepianWolf (SW) coding system is a source coding system with two e...
read it

Lossless Source Coding in the PointtoPoint, Multiple Access, and Random Access Scenarios
This paper treats pointtopoint, multiple access and random access loss...
read it

Functional Epsilon Entropy
We consider the problem of coding for computing with maximal distortion,...
read it

A Unified Framework for Problems on Guessing, Source Coding and Task Partitioning
We study four problems namely, Campbell's source coding problem, Arikan'...
read it

The Explicit Coding Rate Region of Symmetric Multilevel Diversity Coding
It is well known that superposition coding, namely separately encoding ...
read it

Fairness in Multiterminal Data Compression: Decomposition of Shapley Value
We consider the problem of how to determine a fair source coding rate al...
read it

Interest Point Detection based on Adaptive Ternary Coding
In this paper, an adaptive pixel ternary coding mechanism is proposed an...
read it
Coding for Computing Arbitrary Functions Unknown to the Encoder
In this paper we consider pointtopoint 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 nonbijective function then the rate region for the pointtopoint source coding problem expands over the entropy, and the rate region over the distributed source coding problem expands over the SlepianWolf rate region. A novel proof technique, similar to random binning, is developed to prove these results.
READ FULL TEXT
Comments
There are no comments yet.