Consider a generalized multiterminal source coding system, where ( l m ) encoders, each observing a distinct sizem subset of l (l ≥ 2) zero-mean unit-variance symmetrically correlated Gaussian sources with correlation coefficient ρ, compress their observations in such a way that a joint decoder can reconstruct the sources within a prescribed mean squared error distortion based on the compressed...

The rate-distortion function for source coding with side information at the decoder (the \Wyner-Ziv problem") is given in terms of an auxiliary random variable, which forms a Markov chain with the source and the side information. This Markov chain structure, typical to the solution of multiterminal source coding problems, corresponds to a loss in coding rate with respect to the conditional rate...

We consider the problem of multiterminal source-channel communication where a number of distributed and possibly correlated sources are transmitted through an orthogonal multiple access channel to a common destination. We characterize the optimal tradeoff between the transmission cost Γ and the distortion vector D as measured against individual sources. Our approach consists of two steps: (1) a...

We present a continuous dual of multiterminal source encoding with one distortion criterion (the \Berger-Yeung problem"). A continuous source X is encoded with \high resolution" (D x ! 0), with the aid of a \helper", i.e., a correlated discrete or continuous source Y , that is encoded separately subject to some arbitrary distortion criterion D y. We nd the asymptotic form of the set of achievab...

We study a problem of data compression for spatial waves. This is a new multiterminal source coding problem, in which the objects to be represented by a network of encoders are solutions of a partial differential equation. In this paper we formulate the problem, and discuss some intial results towards the determination of the rate-distortion region for waves.

A multiterminal lossy coding problem, which includes various problems such as the Wyner-Ziv problem and the complementary delivery problem as special cases, is considered. It is shown that any point in the achievable rate-distortion region can be attained even if the source statistics are not known.

THE demand for ever larger, more efficient, reliable, and cost effective communication networks is motivating new network architectures, such as ad hoc networks, cognitive radio, relay extensions for cellular networks, sensor networks, and wireless mesh networks. The study of such networks requires a fundamental shift from thinking of a network as a collection of independent communication pipes...

We explore the connection between channel and source coding problems. Our study centers on the class of binning schemes that characterize the largest known achievable rates for channel and source coding problems with partial side information and multiterminal scenarios. The binning scheme can be viewed as a set of bins with each bin forming a channel code (with error probability 22) and set of ...