Data processing lower bounds for scalar lossy source codes with side information at the decoder

In this paper, we derive 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.