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

Rami Ezzine, Moritz Wiese, Christian Deppe, Holger Boche

Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

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 ?-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 ?. We establish a lower and an upper bound on the ?-UCR capacity using the bounds on the ?-transmission capacity proved by Verdú and Han for arbitrary point-to-point channels.A detailed version with all proofs, explanations and more discussions can be found in [1].

OriginalspracheEnglisch
Titel2023 IEEE International Symposium on Information Theory, ISIT 2023
Herausgeber (Verlag)Institute of Electrical and Electronics Engineers Inc.
Seiten240-245
Seitenumfang6
ISBN (elektronisch)9781665475549
DOIs
PublikationsstatusVeröffentlicht - 2023
Veranstaltung2023 IEEE International Symposium on Information Theory, ISIT 2023 - Taipei, Taiwan
Dauer: 25 Juni 202330 Juni 2023

Publikationsreihe

NameIEEE International Symposium on Information Theory - Proceedings
Band2023-June
ISSN (Print)2157-8095

Konferenz

Konferenz2023 IEEE International Symposium on Information Theory, ISIT 2023
Land/GebietTaiwan
OrtTaipei
Zeitraum25/06/2330/06/23

Fingerprint

Untersuchen Sie die Forschungsthemen von „A Lower and Upper Bound on the Epsilon-Uniform Common Randomness Capacity“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren