By Topic

Sum Rate of the Vacationing-CEO Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Soundararajan, R. ; Dept. of Electr. & Comput. Eng., Univ. of Texas at Austin, Austin, TX, USA ; Wagner, A.B. ; Vishwanath, S.

The vacationing chief executive officer (CEO) problem combines the salient features of the so-called CEO problem and the multiple-description (MD) problem. In this setting, noisy versions of a source are observed by two encoders, as in the CEO problem. In addition, we require that each encoder generate MDs of the source, as in the MD problem. The vacationing-CEO problem arises in asynchronous multicast networks, and solving it is an essential step in developing a general theory for multiencoder and multidecoder lossy compression. In this paper, an achievable sum rate and two sum rate lower bounds are presented for the quadratic Gaussian vacationing-CEO problem. These bounds exactly determine the optimal sum rate over a wide range of parameters.

Published in:

Information Theory, IEEE Transactions on  (Volume:58 ,  Issue: 10 )