COMMON RANDOMNESS IN INFORMATION-THEORY AND CRYPTOGRAPHY - PART-II - CR CAPACITY

Citation
R. Ahlswede et I. Csiszar, COMMON RANDOMNESS IN INFORMATION-THEORY AND CRYPTOGRAPHY - PART-II - CR CAPACITY, IEEE transactions on information theory, 44(1), 1998, pp. 225-240
Citations number
25
Categorie Soggetti
Computer Science Information Systems","Engineering, Eletrical & Electronic","Computer Science Information Systems
ISSN journal
00189448
Volume
44
Issue
1
Year of publication
1998
Pages
225 - 240
Database
ISI
SICI code
0018-9448(1998)44:1<225:CRIIAC>2.0.ZU;2-K
Abstract
The common randomness (CR) capacity of a two-teminal model is defined as the maximum rate of common randomness that the terminals can genera te using resources specified by the given model. We determine CR capac ity for several models, including those whose statistics depend on unk nown parameters, The CR capacity is shown to be achievable robustly, b y common randomness of nearly uniform distribution no matter what the unknown parameters are, Our CR capacity results are relevant for the p roblem of identification capacity, and also yield a new result on the regular (transmission) capacity of arbitrarily varying channels with f eedback.