Coding for relay channels with confidential messages
- 13 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableAll Related Versions
This publication has 9 references indexed in Scilit:
- Common randomness and secret key generation with a helperIEEE Transactions on Information Theory, 2000
- The common randomness capacity of a network of discrete memoryless channelsIEEE Transactions on Information Theory, 2000
- Common randomness in information theory and cryptography. II. CR capacityIEEE Transactions on Information Theory, 1998
- Common randomness in information theory and cryptography. I. Secret sharingIEEE Transactions on Information Theory, 1993
- Secret key agreement by public discussion from common informationIEEE Transactions on Information Theory, 1993
- Capacity theorems for the relay channelIEEE Transactions on Information Theory, 1979
- Broadcast channels with confidential messagesIEEE Transactions on Information Theory, 1978
- The Wire-Tap ChannelBell System Technical Journal, 1975
- Communication Theory of Secrecy Systems*Bell System Technical Journal, 1949