By Topic

Source coding with side information at several decoders

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

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.

Published in:

Information Theory, IEEE Transactions on  (Volume:23 ,  Issue: 2 )