New results in binary multiple descriptions
IEEE Transactions on Information Theory
Elements of information theory
Elements of information theory
Vector Gaussian multiple description with two levels of receivers
IEEE Transactions on Information Theory
Approximating the Gaussian multiple description rate region under symmetric distortion constraints
IEEE Transactions on Information Theory
A rate-splitting approach to the Gaussian multiple-access channel
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Rate-splitting multiple access for discrete memoryless channels
IEEE Transactions on Information Theory
Generalized time sharing: a low-complexity capacity-achieving multiple-access technique
IEEE Transactions on Information Theory
Multiple description coding with many channels
IEEE Transactions on Information Theory
n-channel symmetric multiple descriptions - part I: (n, k) source-channel erasure codes
IEEE Transactions on Information Theory
n-channel symmetric multiple descriptions-part II: An achievable rate-distortion region
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Multiple Description Quantization Via Gram–Schmidt Orthogonalization
IEEE Transactions on Information Theory
Vector Gaussian Multiple Description With Individual and Central Receivers
IEEE Transactions on Information Theory
Successive Wyner–Ziv Coding Scheme and Its Application to the Quadratic Gaussian CEO Problem
IEEE Transactions on Information Theory
Robust Distributed Source Coding
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Gaussian multiple description coding with individual and central distortion constraints
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
A three-layer scheme for M-channel multiple description image coding
Signal Processing
Suppressing the Cliff Effect in Video Reproduction Quality
Bell Labs Technical Journal
Hi-index | 754.90 |
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 first one is akin to the method seen in the well-known butterfly network of network coding literature, and systematic erasure channel codes are applied on certain carefully chosen source coding component; the second approach is built on the quantization splitting technique which was previously proven useful in the Gaussian CEO problem. We first focus on a special case of the three description problem, where any two descriptions are rate-distortion optimal jointly, referred to as the no two description excess rate case. For this special case and the quadratic Gaussian source, we show that the two aforementioned approaches lead to rate-distortion points outside the achievable region based on the source-channel erasure codes, previously proposed by Pradhan, Puri, and Ramchandran. Interestingly, though only the symmetric problem is considered in our work, the proposed schemes in fact benefit from time-sharing several asymmetric rate-distortion points. The insights gained through the no two description excess rate case lead to strategic combination of the new ingredients with the existing coding scheme, yielding new coding schemes for the symmetric K -description problem.