By Topic

Source coding with side information and a converse for degraded broadcast channels

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

2 Author(s)

Let {(X_i, Y_i,)}_{i=1}^{\infty } be a memoryless correlated source with finite alphabets, and let us imagine that one person, encoder 1, observes only X^n = X_1,\cdots ,X_n and another person, encoder 2, observes only Y^n = Y_1,\cdots ,Y_n . The encoders can produce encoding functions f_n(X^n) and g_n(Y^n) respectively, which are made available to the decoder. We determine the rate region in case the decoder is interested only in knowing Y^n = Y_1,\cdots ,Y_n (with small error probability). In Section H of the paper we give a characterization of the capacity region for degraded broadcast channels (DBC's), which was conjectured by Bergmans [11] and is somewhat sharper than the one obtained by Gallager [12].

Published in:

IEEE Transactions on Information Theory  (Volume:21 ,  Issue: 6 )