Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Lower and Upper Bound on the Epsilon-Uniform Common Randomness Capacity (2305.05524v1)

Published 9 May 2023 in cs.IT and 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.

Citations (1)

Summary

We haven't generated a summary for this paper yet.