论文信息 - General broadcast channels with degraded message sets

General broadcast channels with degraded message sets

A broadcast channel with one sender and two receivers is considered. Three independent messages are to be transmitted over this channel: one common message which is meant for both receivers, and one private message for each of them. The coding theorem and strong converse for this communication situation is proved for the case when one of the private messages has rate zero.

János Körner | Katalin Marton | K. Marton | J. Körner

[1] Rudolf Ahlswede,et al. Source coding with side information and a converse for degraded broadcast channels , 1975, IEEE Trans. Inf. Theory.

[2] Robert G. Gallager,et al. Capacity and coding for degraded broadcast channels , 1974 .

[3] Patrick P. Bergmans,et al. Random coding theorem for broadcast channels with degraded components , 1973, IEEE Trans. Inf. Theory.

[4] János Körner,et al. Images of a set via two channels and their role in multi-user communication , 1977, IEEE Trans. Inf. Theory.

[5] Edward C. van der Meulen,et al. Random coding theorems for the general discrete memoryless broadcast channel , 1975, IEEE Trans. Inf. Theory.

[6] P. Gács,et al. Bounds on conditional probabilities with applications in multi-user communication , 1976 .

[7] Michel Loève,et al. Probability Theory I , 1977 .

[8] Aaron D. Wyner,et al. A theorem on the entropy of certain binary sequences and applications-I , 1973, IEEE Trans. Inf. Theory.

[9] A. Sridharan. Broadcast Channels , 2022 .

[10] Thomas M. Cover,et al. An achievable rate region for the broadcast channel , 1975, IEEE Trans. Inf. Theory.

[11] Aaron D. Wyner,et al. A theorem on the entropy of certain binary sequences and applications-II , 1973, IEEE Trans. Inf. Theory.