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

by   Rami Ezzine, et al.

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ú and Han for arbitrary point-to-point channels.


page 1

page 2

page 3

page 4


A General Formula for Uniform Common Randomness Capacity

We generalize the uniform common randomness capacity formula, initially ...

On the Common Randomness Capacity of a Special Class of Two-way Channels

In this paper, we would like to study the common randomness (CR) capacit...

Common Randomness Generation from Sources with Countable Alphabet

We study a standard two-source model for common randomness (CR) generati...

Common Randomness Generation from Gaussian Sources

We study the problem of common randomness (CR) generation in the basic t...

Certified Randomness from Bell's Theorem and Remote State Preparation Dimension Witness

Randomness can be device-independently certified from a set of experimen...

Construction and Analysis of Posterior Matching in Arbitrary Dimensions via Optimal Transport

The posterior matching scheme, for feedback encoding of a message point ...

EDGF: Empirical dataset generation framework for wireless network networks

In wireless sensor networks (WSNs), simulation practices, system models,...

Please sign up or login with your details

Forgot password? Click here to reset