Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Successive encoding of correlated sources

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
$31 $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

2 Author(s)

The encoding of a discrete memoryless multiple source {( X_{i}, Y_{i})}_{i=1}^{\infty } for reconstruction of a sequence \{Z_{i}\}_{\infty \atop i=1} , with Z_{i} = F( X_{i}, Y_{i}); i = 1,2, \cdots is considered. We require that the encoding should be such that {X_{i}}_{i=1}^{\infty } is encoded first without any consideration of {Y_{i}}_{i=1}^{\infty } , while in a second part of the encoding, this latter sequence is encoded based on knowledge of the outcome of the first encoding. The resulting scheme is called successive encoding. We find general outer and inner bounds for the corresponding set of achievable rates along with a complete single letter characterization for the special case H( X_{i}|Z_{i}, Y_{i}) = 0 . Comparisons with the Slepian-Wolf problem and the Ahlswede-Korner-Wyner side information problem are carried out.

Published in:

Information Theory, IEEE Transactions on  (Volume:29 ,  Issue: 3 )