The common randomness capacity of a pair of independent discrete memoryless channels
Authors:
- S. VenkatesanSVS. Venkatesan
- V. AnantharamVAV. Anantharam
- 1 January 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 44 (1) , 215-224
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- 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
- Perfect cryptographic security from partially independent channels1991
- On identification via multiway channels with feedbackIEEE Transactions on Information Theory, 1991
- Identification via channelsIEEE Transactions on Information Theory, 1989
- Identification in the presence of feedback-a discovery of new capacity formulasIEEE Transactions on Information Theory, 1989
- The capacity of the arbitrarily varying channel revisited: positivity, constraintsIEEE Transactions on Information Theory, 1988
- Elimination of correlation in random codes for arbitrarily varying channelsProbability Theory and Related Fields, 1978