Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 9 May 2023 in cs.IT and math.IT | (2305.05524v1)

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.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.