Common Randomness in Information Theory and Cryptography - Part II: CR Capacity

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 feedback.

[1]  D. Blackwell,et al.  The Capacities of Certain Channel Classes Under Random Coding , 1960 .

[2]  Jacob Wolfowitz,et al.  Channels with Arbitrarily Varying Channel Probability Functions , 1962, Inf. Control..

[3]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[4]  R. Ahlswede.  Elimination of correlation in random codes for arbitrarily varying channels , 1978 .

[5]  Rudolf Ahlswede,et al.  Coloring hypergraphs: A new approach to multi-user source coding, 1 , 1979 .

[6]  Rudolf Ahlswede,et al.  A method of coding and its application to arbitrarily varying channels , 1980 .

[7]  I. Csiszár,et al.  On the capacity of the arbitrarily varying channel for maximum probability of error , 1981 .

[8]  Imre Csiszár,et al.  The capacity of the arbitrarily varying channel revisited: Positivity, constraints , 1988, IEEE Trans. Inf. Theory.

[9]  Rudolf Ahlswede,et al.  Identification in the presence of feedback-A discovery of new capacity formulas , 1989, IEEE Trans. Inf. Theory.

[10]  Rudolf Ahlswede,et al.  Identification via channels , 1989, IEEE Trans. Inf. Theory.

[11]  Imre Csiszár,et al.  Capacity of the Gaussian arbitrarily varying channel , 1991, IEEE Trans. Inf. Theory.

[12]  Rudolf Ahlswede,et al.  On identification via multiway channels with feedback , 1991, IEEE Trans. Inf. Theory.

[13]  Rudolf Ahlswede,et al.  Common randomness in information theory and cryptography - I: Secret sharing , 1993, IEEE Trans. Inf. Theory.

[14]  Rudolf Ahlswede,et al.  New directions in the theory of identification via channels , 1995, IEEE Trans. Inf. Theory.

[15]  V. Balakirsky,et al.  Identification under random processes , 1996 .

[16]  Alon Orlitsky.  Interactive communication , 1996, Optics & Photonics.

[17]  Venkat Anantharam,et al.  The Common Randomness Capacity of a Pair of Independent Discrete Memoryless Channels , 1998, IEEE Trans. Inf. Theory.

[18]  R. Ahlswede.  On Identification via Multi-Way Channels with Feedback: Mystery Numbers , 2021 .