A Simple Converse for Broadcast Channels with Additive White Gaussian Noise

IEEE Transactions on Information Theory

Volumn 20, Issue 2, 1974, Pages 279-280

  Bergmans, Patrick P ^a  

^a Department of Molecular Biology and Genetics   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

EID: 0016037985     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1974.1055184     Document Type: Article

References (5)

1. T. M. Cover “Broadcast channels,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 2–14, Jan. 1972.
2. P. P. Bergmans “Random coding theorem for broadcast channels with degraded components,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 197–207, Mar. 1973.
3. C. E. Shannon, “A mathematical theory of communication,” Bell Syst. Tech. J., vol. 27, pp. 379–423 (pt. I), pp. 623–656 (pt. II), 1948.
4. N. M. Blachman “The convolution inequality for entropy powers,” IEEE Trans. Inform. Theory, vol. IT-11, pp. 267–271, Apr. 1965.
5. A. D. Wyner and J. Ziv “A theorem on the entropy of certain binary sequences and applications: Part I,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 769–772, Nov. 1973.