A source coding problem is considered which generalizes source coding with side information [1], [2]. Three correlated information sourcesX,YandZ, are block-encoded:Yis to be reconstructed by two different decoders, one having access to the encoded version ofXand the other having access to the encoded version ofZ. 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.
No takes yet. Share an insight, caveat, or question.
Andrea Sgarro (1977) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: