Pith. sign in

REVIEW

A General Formula for 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 2205.04594 v4 pith:FBXIUVRW submitted 2022-05-09 cs.IT math.IT

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

We generalize the uniform common randomness capacity formula, initially established by Ahslwede and Csisz\'ar for a two-source model for common randomness generation from independent and identically distributed (i.i.d.) discrete sources with unidirectional communication over rate-limited discrete noiseless channels to the case when the one-way communication is over arbitrary single-user channels. In our proof, we will make use of the transmission capacity formula established by Verd\'u and Han for arbitrary point-to-point channels.

Discussion (0). Sign in to comment.

Pith tools