On the secrecy of multiple access wiretap channel

46th Annual Allerton Conference on Communication, Control, and Computing

Volumn , Issue , 2008, Pages 1014-1021

  Ekrem, Ersen ^a   Ulukus, Sennur ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACHIEVABLE RATES; ACHIEVABLE REGIONS; CAPACITY REGIONS; CLOSE APPROXIMATIONS; GAUSSIAN; MULTIPLE ACCESS; OUTER BOUNDS; SECRECY CAPACITIES; WIRETAP CHANNELS;

COMMUNICATION CHANNELS (INFORMATION THEORY);

TRELLIS CODES;

EID: 64549142381     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2008.4797670     Document Type: Conference Paper

References (11)

1. A. Wyner. The wire-tap channel. Bell Syst. Tech. J., 54 (8) :1355-1387
2. Jan. 1975.
3. I. Csiszar and J. Korner. Broadcast channels with confidential messages. IEEE Trans. Inf. Theory, IT-24 (3) :339-348, May 1978.
4. E. Tekin and A. Yener. The Gaussian multiple access wire-tap channel. Submitted to IEEE Trans. Inf. Theory, May 2006.
5. E. Tekin and A. Yener. The general Gaussian multiple access and two-way wire-tap channels: Achievable rates and cooperative jamming. IEEE Trans. Inf. Theory, 54 (6) :2735-2751, Jun. 2008.
6. M. H. M. Costa and A. El Gamal. The capacity region of the discrete memoryless interference channel with strong interefence. IEEE Trans. Inf. Theory, IT-33 (5) :710-711, Sep. 1987.
7. A. Carleial. A case where interference does not reduce capacity. IEEE Trans. Inf. Theory, IT-21 (5) :569-570, Sep. 1975.
8. T. Cover and J. Thomas. Elements of Information Theory. Wiley and Sons, 2006. 2nd edition.
9. M. Madiman and A. Barron. Generalized entropy power inequalities and monotonicity properties of information. IEEE Trans. Inf. Theory, 53 (7) :2317-2329, Jul. 2007.
10. C. E. Shannon. A mathematical theory of communication. Bell Syst. Tech. J., 27:623-656, Oct. 1948.
11. N. M. Blachmann. The convolution inequality for entropy powers. IEEE Trans. Inf. Theory, 11 (2) :267-271, Apr. 1965.