Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2305.05524 v1 pith:HSRWN62M submitted 2023-05-09 cs.IT math.IT

classification cs.ITmath.IT
keywords boldsymbolcapacitycommonepsilonalicerandomnessuniformarbitrary
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Sign in to comment.

Pith tools