Data-Processing Bounds for Scalar Lossy Source Codes With Side Information at the Decoder
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) = t(1-alpha), alpha > 1. The bounds in this case are shown to be better than one can obtain from the Wyner-Ziv rate-distortion function.
source coding side information scalar coding online schemes renyi entropy rate-distortion theory wyner-ziv problem ziv-zakai bounds