The capacity region of the three receiver less noisy broadcast channel

IEEE Transactions on Information Theory

Volumn 57, Issue 7, 2011, Pages 4058-4062

  Nair, Chandra ^a   Wang, Zizhou Vincent ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Broadcast channel; capacity region; less noisy; superposition coding; three receivers

Indexed keywords

BROADCAST CHANNELS; CAPACITY REGIONS; LESS NOISY; SUPER-POSITION CODING; THREE RECEIVERS;

BROADCASTING;

SIGNAL RECEIVERS;

EID: 79959562914     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2011.2145970     Document Type: Article

References (9)

1. I. Csizár and J. Körner, "Broadcast channels with confidential messages," IEEE Trans. Inf. Theory, vol. IT-24, no. 3, pp. 339-348, May 1978.
2. A. El Gamal, "The capacity of a class of broadcast channels," IEEE Trans. Inf. Theory, vol. IT-25, no. 2, pp. 166-169, Mar. 1979.
3. J. Körner and K. Marton, "Comparison of two noisy channels," in Topics in Information Theory, I. Csiszar and P. Elias, Eds. Keszthely, Hungary: Elsevier, 1975, pp. 411-423.
4. J. Körner and K. Marton, "General broadcast channels with degraded message sets," IEEE Trans. Inf. Theory, vol. IT-23, pp. 60-64, 1977.
5. K. Marton, "A coding theorem for the discrete memoryless broadcast channel," IEEE Trans. Inf. Theory, vol. IT-25, no. 3, pp. 306-311, May 1979. (Pubitemid 9450752)
6. C. Nair, "Capacity regions of two newclasses of two-receiver broadcast channels," IEEE Trans. Inf. Theory, vol. 56, no. 9, pp. 4207-4214, Sep. 2010.
7. C. Nair and A. El Gamal, "The capacity region of a class of threereceiver broadcast channels with degraded message sets," IEEE Trans. Inf. Theory, vol. 55, no. 10, pp. 4479-4493, Oct. 2009.
8. C. Nair and A. El Gamal, "An outer bound to the capacity region of the broadcast channel," IEEE Trans. Inf. Theory, vol. IT-53, no. 1, pp. 350-355, Jan. 2007. (Pubitemid 46056082)
9. C. Nair and V. W. Zizhou, "On the inner and outer bounds of 3-receiver broadcast channels with 2-degraded message sets," in Proc. Int. Symp. Inf. Theory, 2009, pp. 1844-1848.