By Topic

Constrained Wyner-Ziv source coding

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)
Lapidoth, A. ; ETH Zurich, Zurich, Switzerland ; Malar, A. ; Wigger, M.

We generalize the Wyner-Ziv source coding problem with side-information at the decoder to the case where the encoder is required to be able to compute the decoder's reconstruction sequence with some fidelity. This requirement limits the extent to which the reconstruction sequence can depend on the side-information, which is not available to the encoder. For finite-alphabet memoryless sources and single-letter distortion measures we compute the minimal description rate as a function of the joint law of the source and side-information and of the allowed distortions at the encoder and decoder. We also treat memoryless Gaussian sources with mean squared-error distortion measures.

Published in:

Information Theory and Applications Workshop (ITA), 2011

Date of Conference:

6-11 Feb. 2011