Uniform Common Randomness Generation Over Arbitrary Point-to-Point Channels
IEEE Transactions on Information Theory · 2025-07 · 71 (7) · 5312-5329
DOI: 10.1109/tit.2025.3565891 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2025-07. Verfasst von Rami Ezzine und 3 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 32 Literaturangaben. Gefördert von: Federal Ministry of Education and Research of Germany (BMBF) in the Programme of “Souverän, BMBF within the National Initiative on Post Shannon Communication, Bavarian Ministry of Economic Affairs, Regional Development and Energy as part of the Project 6G Future Laboratory Bavaria.
Abstract (Originalsprache)
We consider a standard two-source model for uniform common randomness (UCR) generation, in which two terminals (Terminal A and Terminal B ) observe independent and identically distributed (i.i.d.) samples of a correlated finite source, and where Terminal A is allowed to send information to Terminal B over an arbitrary single-user channel. We provide a general theoretical framework, from which the proofs of a general formula for the UCR capacity and general bounds on the $\epsilon $ -UCR capacity of the specified model follow as special cases. The UCR capacity is defined as the maximum achievable CR rate such that the two terminals can agree on a common uniform or nearly uniform random variable with probability arbitrarily close to one, whereas the $\epsilon $ -UCR capacity is defined as the maximum CR rate that can be achieved such that the probability that the two terminals do not agree on a common uniform or nearly uniform random variable does not exceed $\epsilon $ , where $0 \lt \epsilon \lt 1$ is fixed. The established general formula for the UCR capacity depends on a formula characterizing the transmission capacity of arbitrary point-to-point channels, as elaborated by Verdú and Han. The derived general lower and upper bounds on the $\epsilon $ -UCR capacity depend on corresponding lower and upper bounds on the $\epsilon $ -transmission capacity, as proved by Verdú and Han for arbitrary point-to-point channels. Since we are considering general channels, the derived bounds are equal except possibly for at most countably many points, where discontinuity issues might arise. We further provide two examples of channels for which the established bounds are equal and investigate the left-continuity and monotonicity of the derived lower bound.
Förderung
- Federal Ministry of Education and Research of Germany (BMBF) in the Programme of “Souverän
- BMBF within the National Initiative on Post Shannon Communication
- Bavarian Ministry of Economic Affairs, Regional Development and Energy as part of the Project 6G Future Laboratory Bavaria
- BMBF within NewCom
- BMBF Quantum Programme Quantum Physical Layer Service Integration
- Quantum Internet of Things
- Quanten Drahtloses Campusnetzwerk (QD-CamNetz) Project
- Deutsche Forschungsgemeinschaft (DFG) within the Project “Post Shannon Theorie und Implementierung”
Zitieren
APA
Ezzine, R., Wiese, M., Deppe, C., & Boche, H. (2025). Uniform Common Randomness Generation Over Arbitrary Point-to-Point Channels. IEEE Transactions on Information Theory, 71(7), 5312-5329. https://doi.org/10.1109/tit.2025.3565891
Vancouver
Ezzine R, Wiese M, Deppe C, Boche H. Uniform Common Randomness Generation Over Arbitrary Point-to-Point Channels. IEEE Transactions on Information Theory. 2025;71(7):5312-5329. doi:10.1109/tit.2025.3565891
BibTeX
@article{Ezzine2025,
author = {Ezzine, Rami and Wiese, Moritz and Deppe, Christian and Boche, Holger},
title = {Uniform Common Randomness Generation Over Arbitrary Point-to-Point Channels},
journal = {IEEE Transactions on Information Theory},
year = {2025},
volume = {71},
number = {7},
pages = {5312--5329},
doi = {10.1109/tit.2025.3565891}
}
EUVIMED