A Lower and Upper Bound on the Epsilon-Uniform Common Randomness Capacity
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 \(ε\)-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 \(ε.\) We establish a lower and an upper bound on the \(ε\)-UCR capacity using the bounds on the \(ε\)-transmission capacity proved by Verd\'u and Han for arbitrary point-to-point channels.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.