IEEE Transactions on Information Theory · 1977 · 80 citations · 3 references
EngineeringComputer ScienceElectrical EngineeringData StructuresInformation TheoryKnowledge RepresentationChannel CodingCoding TheoryError Control CodingError-correcting CodesRate-distortion TheorySource Coding
A source coding problem is considered which generalizes source coding with side information [1], [2]. Three correlated information sources <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">X,Y</tex> and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Z</tex> , are block-encoded: <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Y</tex> is to be reconstructed by two different decoders, one having access to the encoded version of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">X</tex> and the other having access to the encoded version of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Z</tex> . 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.
3