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.
Published in:
Information Theory, IEEE Transactions on
(Volume:23
,
Issue:
2
)
Date of Publication:
Mar 1977
- Page(s):
-
179
-
182
- ISSN :
-
0018-9448
- Digital Object Identifier :
-
10.1109/TIT.1977.1055690
- Product Type:
-
Journals & Magazines
- Date of Current Version :
-
06 January 2003
- Issue Date :
-
Mar 1977
- Sponsored by :
-
IEEE Information Theory Society