By Topic

Data-Processing Bounds for Scalar Lossy Source Codes With Side Information at the Decoder

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

2 Author(s)
Reani, A. ; Dept. of Electr. Eng., Technion - Israel Inst. of Technol., Haifa, Israel ; Merhav, N.

In this paper, we introduce new lower bounds on the distortion of scalar fixed-rate codes for lossy compression with side information available at the receiver. These bounds are derived by presenting the relevant random variables as a Markov chain and applying generalized data-processing inequalities a la Ziv and Zakai. We show that by replacing the logarithmic function with other functions, in the data-processing theorem we formulate, we obtain new lower bounds on the distortion of scalar coding with side information at the decoder. The usefulness of these results is demonstrated for uniform sources and the convex function Q(t)=t1-α, α > 1. The bounds in this case are shown to be better than one can obtain from the Wyner-Ziv rate-distortion function.

Published in:

Information Theory, IEEE Transactions on  (Volume:59 ,  Issue: 7 )