n-channel symmetric multiple descriptions-part I:(n, k) source-channel erasure codes

SS Pradhan, R Puri… - IEEE Transactions on …, 2004 - ieeexplore.ieee.org
In this two-part paper, we present a new achievable rate region for the general n-channel
symmetric multiple descriptions problem. In part I, inspired by the concept of maximum …

n-channel symmetric multiple descriptions-part II: An achievable rate-distortion region

R Puri, SS Pradhan… - IEEE Transactions on …, 2005 - ieeexplore.ieee.org
In this Part II of a two-part paper, we present a new achievable rate-distortion region for the
symmetric n-channel multiple-descriptions coding problem (n> 2) where the rate of every …

On the rate-distortion region for multiple descriptions

FW Fu, RW Yeung - IEEE Transactions on Information Theory, 2002 - ieeexplore.ieee.org
We study the problem of source coding with multiple descriptions, which is described as
follows. Let X be a discrete memoryless source. There are two encoders, Encoders 1 and 2 …

Multiple description coding with many channels

R Venkataramani, G Kramer… - IEEE Transactions on …, 2003 - ieeexplore.ieee.org
An achievable region for the L-channel multiple description coding problem is presented.
This region generalizes two-channel results of El Gamal and Cover (1982) and of Zhang …

Multiple description source coding with no excess marginal rate

Z Zhang, T Berger - IEEE Transactions on Information Theory, 1995 - ieeexplore.ieee.org
Multiple description source coding concerns situations in which the transmission of the
source information is distributed over two data streams at rates R/sub 1/and R/sub 2 …

Optimal filter banks for multiple description coding: analysis and synthesis

PL Dragotti, SD Servetto… - IEEE Transactions on …, 2002 - ieeexplore.ieee.org
Multiple description (MD) coding is a source coding technique for information transmission
over unreliable networks. In MD coding, the coder generates several different descriptions of …

New Coding Schemes for the Symmetric -Description Problem

C Tian, J Chen - IEEE Transactions on Information Theory, 2010 - ieeexplore.ieee.org
We propose novel coding schemes for the K-description problem with symmetric rates and
symmetric distortion constraints. There are two main new ingredients in these schemes: the …

Approximating the Gaussian multiple description rate region under symmetric distortion constraints

C Tian, S Mohajer, SN Diggavi - IEEE Transactions on …, 2009 - ieeexplore.ieee.org
We consider multiple description (MD) coding for the Gaussian source with K descriptions
under the symmetric mean-squared error (MSE) distortion constraints, and provide an …

Vector Gaussian multiple description with two levels of receivers

H Wang, P Viswanath - IEEE Transactions on Information …, 2008 - ieeexplore.ieee.org
The problem of L multiple descriptions of a stationary and ergodic Gaussian source with two
levels of receivers is investigated. Each of the first-level receivers receive (an arbitrary …

Gaussian codes and Shannon bounds for multiple descriptions

R Zamir - IEEE transactions on Information Theory, 1999 - ieeexplore.ieee.org
A pair of well-known inequalities, due to Shannon, upper/lower bound the rate-distortion
function of a real source by the rate-distortion function of the Gaussian source with the same …