Computation of Secrecy Capacity for more-capable channel pairs

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 529-533

  Kumar R , Gowtham ^a   Thangaraj, Andrew ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

[No Author keywords available]

Indexed keywords

DISCRETE MEMORYLESS CHANNEL; INITIAL GUESSES; INTERNATIONAL SYMPOSIUM; MULTI-INPUT; SECRECY CAPACITY;

CYBERNETICS; INFORMATION THEORY; TECHNICAL PRESENTATIONS;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 52349106587     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4595042     Document Type: Conference Paper

References (9)

1. A. D. Wyner, The wire-tap channel, Bell Syst. Tech. J., vol. 54, pp. 1355-1387, 1975.
2. I. Csisźar and J. Körner, Broadcast Channels with Confidential Messages, IEEE trans. inform. theory, vol. 24, no. 3, pp. 339-348, 1978.
3. S. Arimoto, An algorithm for computing the capacity of arbitrary discrete memoryless channels, IEEE trans. inform. theory, vol. 18, no. 1, pp. 14-20, 1972.
4. R.E. Blahut, Computation of Channel Capacity and rate-distortion functions, IEEE trans. inform. theory, vol. 18, no. 4, pp. 460-473, 1972.
5. M. Van Dijk, On a special class of broadcast channels with confidential messages, IEEE trans. inform. theory, vol. 43, no. 2, pp. 712-714, 1997.
6. Kensuke Yasui, Tota Suko and Toshiyasu Matsushima, An algorithm for computing the Secrecy Capacity of Broadcast Channels with Confidential messages, International Symposium on inform. theory, pp. 936-940, 2007.
7. J. Köhner and K. Marton, Comparison of two noisy channels, Topics in Information theory, pp. 411-423, 1977.
8. Stephen Boyd and Lieven Vandenberghe, Convex Optimization, Cambridge university press.
9. Thomas M. Cover and Joy A. Thomas, Elements of Information Theory, 1st Edition, New York: Wiley-Inter science, 1991.