The Single-Serving Channel Capacity
- 1 July 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1424-1427
Abstract
In this paper we provide the answer to the following question: given a noisy channel P Y|X and epsi > 0, how many bits can be transmitted with an error of at most epsi by a single use of the channelKeywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Zero-error information and applications in cryptography2005
- Simple and Tight Bounds for Information Reconciliation and Privacy Amplification2005
- Communication cost of entanglement transformationsPhysical Review A, 2003
- 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
- Privacy Amplification by Public DiscussionSIAM Journal on Computing, 1988
- Broadcast channels with confidential messagesIEEE Transactions on Information Theory, 1978
- The Wire-Tap ChannelBell System Technical Journal, 1975
- Noiseless coding of correlated information sourcesIEEE Transactions on Information Theory, 1973
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948