2000 character limit reached
The Sum Rate of Vector Gaussian Multiple Description Coding with Tree-Structured Covariance Distortion Constraints
Published 28 Jul 2016 in cs.IT and math.IT | (1607.08297v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.