Source coding with side information and a converse for degraded broadcast channels
- 1 November 1975
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 21 (6) , 629-637
- https://doi.org/10.1109/tit.1975.1055469
Abstract
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 onlyX^n = X_1,\cdots,X_nand another person, encoder 2, observes onlyY^n = Y_1,\cdots,Y_n. The encoders can produce encoding functionsf_n(X^n)andg_n(Y^n)respectively, which are made available to the decoder. We determine the rate region in case the decoder is interested only in knowingY^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].Keywords
This publication has 7 references indexed in Scilit:
- On Sequences of Pairs of Dependent Random VariablesSIAM Journal on Applied Mathematics, 1975
- A theorem on the entropy of certain binary sequences and applications--IIEEE Transactions on Information Theory, 1973
- Noiseless coding of correlated information sourcesIEEE Transactions on Information Theory, 1973
- Random coding theorem for broadcast channels with degraded componentsIEEE Transactions on Information Theory, 1973
- Broadcast channelsIEEE Transactions on Information Theory, 1972
- Coding Theorems of Information TheoryPublished by Springer Nature ,1964
- A new basic theorem of information theoryTransactions of the IRE Professional Group on Information Theory, 1954