Pith. sign in

REVIEW

Common Randomness Generation from Gaussian Sources

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 2201.11078 v1 pith:IXOLDQNL submitted 2022-01-26 cs.IT math.IT

classification cs.ITmath.IT
keywords commongaussiansourcescapacitycorrelatedgenerationproblemrandomness
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We study the problem of common randomness (CR) generation in the basic two-party communication setting in which the sender and the receiver aim to agree on a common random variable with high probability by observing independent and identically distributed (i.i.d.) samples of correlated Gaussian sources and while communicating as little as possible over a noisy memoryless channel. We completely solve the problem by giving a single-letter characterization of the CR capacity for the proposed model and by providing a rigorous proof of it. Interestingly, we prove that the CR capacity is infinite when the Gaussian sources are perfectly correlated.

Discussion (0). Sign in to comment.

Pith tools