English

A Lower and Upper Bound on the Epsilon-Uniform Common Randomness Capacity

Information Theory 2023-05-10 v1 math.IT

Abstract

We consider a standard two-source model for uniform common randomness (UCR) generation, in which Alice and Bob observe independent and identically distributed (i.i.d.) samples of a correlated finite source and where Alice is allowed to send information to Bob over an arbitrary single-user channel. We study the ϵ\boldsymbol{\epsilon}-UCR capacity for the proposed model, defined as the maximum common randomness rate one can achieve such that the probability that Alice and Bob do not agree on a common uniform or nearly uniform random variable does not exceed ϵ.\boldsymbol{\epsilon}. We establish a lower and an upper bound on the ϵ\boldsymbol{\epsilon}-UCR capacity using the bounds on the ϵ\boldsymbol{\epsilon}-transmission capacity proved by Verd\'u and Han for arbitrary point-to-point channels.

Keywords

Cite

@article{arxiv.2305.05524,
  title  = {A Lower and Upper Bound on the Epsilon-Uniform Common Randomness Capacity},
  author = {Rami Ezzine and Moritz Wiese and Christian Deppe and Holger Boche},
  journal= {arXiv preprint arXiv:2305.05524},
  year   = {2023}
}

Comments

arXiv admin note: substantial text overlap with arXiv:2205.04594, arXiv:2210.11932

R2 v1 2026-06-28T10:29:58.138Z