Lossy Source Coding over Cascade Network

A lossy source coding with side information problem with one encoder and two cascaded decoders is considered. Several  variations of this problem have been studied for various source and side information distributions, availability  of the side information at encoder and/or either of the decoders. In this work we study this problem for binary source with erasure side information. The set of achievable rate-distortion triples is characterized for three instances of this problem when Hamming distortion is used to quantify the reconstruction quality.