We show that distributed source coding of multi-view images in camera sensor networks (CSNs) using adaptive modules can come close to the Slepian-Wolf bound. In a systematic scenario with limited node abilities, work by Slepian and Wolf suggest that it is possible to encode statistically dependent signals in a distributed manner to the same rate as with a system where the signals are jointly en...

A new finite blocklength converse for the SlepianWolf coding problem is presented which significantly improves on the best known converse for this problem, due to Miyake and Kanaya [2]. To obtain this converse, an extension of the linear programming (LP) based framework for finite blocklength pointto-point coding problems from [3] is employed. However, a direct application of this framework dem...

Building upon Slepian-Wolf coding, sparse-graph codes, belief propagation, and closed-loop iterative doping, we propose new schemes for interactive data exchange between two agents who want to communicate losslessly their respective information via several rounds of communication.

In this correspondence, we describe the achievable rate region for reliably recovering deterministic functions of correlated sources which have a finite alphabet. The method of proof is almost the same as that used to prove the Slepian-Wolf theorem.

In this correspondence, we describe the achievable rate region for reliably recovering deterministic functions of correlated sources which have a finite alphabet. The method of proof is almost the same as that used to prove the Slepian-Wolf theorem.

In the last few decades, a series of increasingly sophisticated satellite missions has brought us gravity and magnetometry data of ever improving quality. To make optimal use of this rich source of information on the structure of the Earth and other celestial bodies, our computational algorithms should be well matched to the specific properties of the data. In particular, inversion methods requ...

This paper attempts to examine the optimality of LDPC codes for compression of nonuniform source with Slepian-Wolf coding using density evolution technique. The primary goal is to evaluate the performance of LDPC codes with reference to turbo codes (in SF-ISF setup). The appreciable difference between LDPC and turbo codes is also discussed in this paper. The threshold values obtained from the d...