Secrecy capacity of semi-deterministic wire-tap channels

Proceedings of the 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks, ITW

Volumn , Issue , 2007, Pages 199-202

  Grubb, Jared ^a   Vishwanath, Sriram ^a   Liang, Yingbin ^b   Poor, H Vincent ^b  

^a The University of Texas at Austin   (United States)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMMUNICATION CHANNELS (INFORMATION THEORY); INFORMATION THEORY; TECHNICAL PRESENTATIONS; WIRE;

CONFIDENTIAL MESSAGES; DISCRETE MEMORYLESS CHANNELS; ERROR CORRECTING CODES; LEGITIMATE USERS; MULTIPLE ACCESSES; OUTER BOUNDS; POINT SETTINGS; SECRECY CAPACITIES; SECRET INFORMATIONS; SINGLE WIRES;

WIRELESS NETWORKS;

EID: 47849092063     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITWITWN.2007.4318063     Document Type: Conference Paper

References (8)

1. A. D. Wyner, "The wire-tap channel," Bell Syst. Tech. J., vol. 54, no. 8, pp. 1355-1387, Oct. 1975.
2. I. Csiszár and J. Körner, "Broadcast channel with confidential messages," IEEE Trans. Inform. Theory, vol. 24, no. 3, pp. 339-348, May 1978.
3. S. K. L. Yan Cheong, "On a special class of wiretap channels," IEEE Trans. Inform. Theory, Sept. 1977.
4. H. Yamamoto, "Coding theorem for secret sharing communication systems with two noisy channels," IEEE Trans. Inform. Theory, May 1989.
5. H. Koga and N. Sato, "On an upper bound for the secrecy capcity for a general wiretap channel," Proc. IEEE Intl. Symp. Inform. Theory, Sept. 2005.
6. Y. Oohama, "Coding for relay channels with confidential messages," Proc. IEEE Inform. Theory Workshop, Sept. 2001.
7. Y. Liang and H. V. Poor, "Generalized multiple access channels with confidential messages," IEEE Trans. Inform. Theory, April 2006, under review.
8. K. Marton, "A coding theorem for the discrete memoryless broadcast channel," IEEE Trans. Inform. Theory, May 1979.