Source coding with side information at several decoders

A source coding problem is considered which generalizes source coding with side information [1], [2]. Three correlated information sources
X,Y
and
Z
, are block-encoded:
Y
is to be reconstructed by two different decoders, one having access to the encoded version of
X
and the other having access to the encoded version of
Z
. The region of achievable rates is determined, assuming that thc sources are discrete, memoryless, and stationary. The resuit is generalized to an arbitrary finite number of decoders.