On the Vacationing CEO Problem: Achievable Rates and Outer Bounds
Information Theory
2010-01-07 v1 math.IT
Abstract
This paper studies a class of source coding problems that combines elements of the CEO problem with the multiple description problem. In this setting, noisy versions of one remote source are observed by two nodes with encoders (which is similar to the CEO problem). However, it differs from the CEO problem in that each node must generate multiple descriptions of the source. This problem is of interest in multiple scenarios in efficient communication over networks. In this paper, an achievable region and an outer bound are presented for this problem, which is shown to be sum rate optimal for a class of distortion constraints.
Cite
@article{arxiv.1001.0793,
title = {On the Vacationing CEO Problem: Achievable Rates and Outer Bounds},
author = {Rajiv Soundararajan and Aaron B. Wagner and Sriram Vishwanath},
journal= {arXiv preprint arXiv:1001.0793},
year = {2010}
}
Comments
19 pages, 1 figure, ISIT 2010