Common randomness in information theory and cryptography. II. CR capacity
- 1 January 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 44 (1) , 225-240
- https://doi.org/10.1109/18.651026
Abstract
For pt.I see ibid., vol.39, p.1121, 1993. The common randomness (CR) capacity of a two-terminal model is defined as the maximum rate of common randomness that the terminals can generate using resources specified by the given model. We determine CR capacity for several models, including those whose statistics depend on unknown parameters. The CR capacity is shown to be achievable robustly, by common randomness of nearly uniform distribution no matter what the unknown parameters are. Our CR capacity results are relevant for the problem of identification capacity, and also yield a new result on the regular (transmission) capacity of arbitrarily varying channels with feedbackKeywords
This publication has 12 references indexed in Scilit:
- Common randomness in information theory and cryptography. I. Secret sharingIEEE Transactions on Information Theory, 1993
- Capacity of the Gaussian arbitrarily varying channelIEEE Transactions on Information Theory, 1991
- 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
- On the capacity of the arbitrarily varying channel for maximum probability of errorProbability Theory and Related Fields, 1981
- Noiseless coding of correlated information sourcesIEEE Transactions on Information Theory, 1973
- Channels with arbitrarily varying channel probability functionsInformation and Control, 1962
- The Capacities of Certain Channel Classes Under Random CodingThe Annals of Mathematical Statistics, 1960