The Sum Rate of Vector Gaussian Multiple Description Coding with Tree-Structured Covariance Distortion Constraints
Information Theory
2016-07-29 v1 math.IT
Abstract
A single-letter lower bound on the sum rate of multiple description coding with tree-structured distortion constraints is established by generalizing Ozarow's celebrated converse argument through the introduction of auxiliary random variables that form a Markov tree. For the quadratic vector Gaussian case, this lower bound is shown to be achievable by an extended version of the El Gamal-Cover scheme, yielding a complete sum-rate characterization.
Cite
@article{arxiv.1607.08297,
title = {The Sum Rate of Vector Gaussian Multiple Description Coding with Tree-Structured Covariance Distortion Constraints},
author = {Yinfei Xu and Jun Chen and Qiao Wang},
journal= {arXiv preprint arXiv:1607.08297},
year = {2016}
}