A new entropy power inequality
IEEE Transactions on Information Theory
Approximating the Gaussian multiple description rate region under symmetric distortion constraints
IEEE Transactions on Information Theory
A vector generalization of costa's entropy-power inequality with applications
IEEE Transactions on Information Theory
New coding schemes for the symmetric K -description problem
IEEE Transactions on Information Theory
The worst additive noise under a covariance constraint
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
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 Coding in Multiuser 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 vector generalization of costa's entropy-power inequality with applications
IEEE Transactions on Information Theory
Multipath routing over wireless mesh networks for multiple description video transmission
IEEE Journal on Selected Areas in Communications
Asymmetric multilevel diversity coding and asymmetric Gaussian multiple descriptions
IEEE Transactions on Information Theory
| Hi-index | 754.96 |
The rate region of Gaussian multiple description coding with individual and central distortion constraints is completely characterized. Specifically, a lower bound and an upper bound are derived for each supporting hyperplane of the rate region, where the lower bound is associated with a max-min game while the upper bound is associated with a min-max game; furthermore, it is shown that these two bounds coincide due to the existence of a saddle point.