A proof of Marton's coding theorem for the discrete memoryless broadcast channel (Corresp.)
- 1 January 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 27 (1) , 120-122
- https://doi.org/10.1109/tit.1981.1056302
Abstract
A simple proof using random partitions and typicality is given for Marton's coding theorem for broadcast channels.Keywords
This publication has 7 references indexed in Scilit:
- Capacity theorems for the relay channelIEEE Transactions on Information Theory, 1979
- A coding theorem for the discrete memoryless broadcast channelIEEE Transactions on Information Theory, 1979
- A survey of multi-way channels in information theory: 1961-1976IEEE Transactions on Information Theory, 1977
- An achievable rate region for the broadcast channelIEEE Transactions on Information Theory, 1975
- Random coding theorems for the general discrete memoryless broadcast channelIEEE Transactions on Information Theory, 1975
- A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.)IEEE Transactions on Information Theory, 1975
- Random coding theorem for broadcast channels with degraded componentsIEEE Transactions on Information Theory, 1973