Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

On approximating the rate regions for lossy source coding with coded and uncoded side information

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)
WeiHsin Gut ; Deparmment of Electr. Eng., California Inst. of Technol., Pasadena, CA ; Jana, Soumya ; Effros, M.

We derive new algorithms for approximating the rate regions for a family of source coding problems that includes lossy source coding, lossy source coding with uncoded side information at the receiver (the Wyner-Ziv problem), and an achievability bound for lossy source coding with coded side in formation at the receiver. The new algorithms generalize a recent approximation algorithm by Go and Effros from lossless to lossy coding. In each case, prior information theoretic descriptions of the desired regions are available but difficult to evaluate for example sources due to their dependence on auxiliary random variables. Our algorithm builds a linear program whose solution is no less than the desired lower bound and no greater than (1 + isin) times that optimal value. These guarantees are met even when the optimal value is unknown. Here isin > 0 is a parameter chosen by the user; the algorithmic complexity grows as O(isin-M) as e approaches 0, where M > 4 is a constant that depends on the source coding problem and the alphabet sizes of the sources.

Published in:

Information Theory, 2008. ISIT 2008. IEEE International Symposium on

Date of Conference:

6-11 July 2008