Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Transactions on Information Theory

Uniform Common Randomness Generation Over Arbitrary Point-to-Point Channels

Rami Ezzine, Moritz Wiese, Christian Deppe, Holger Boche

Published Apr 30, 2025• 1 citation
Publisher
DOI
10.1109/tit.2025.3565891

Related papers

Optimal Signal Processing for Common Randomness Generation over MIMO Gaussian Channels with Applications in Identification

Rami Ezzine, Wafa Labidi, Christian Deppe +1 more

arXiv:2011.05929•Lecture notes in computer science•Jan 1, 2025•1 citation

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

Rami Ezzine, Moritz Wiese, Christian Deppe +1 more

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].

arXiv:2305.05524•IEEE International Symposium on Information Theory (ISIT)•Jun 25, 2023•5 citations

Practical private randomness generation

Stefano Pironio, Serge Massar

•Nov 25, 2011•0 citations

Full randomness from arbitrarily deterministic events

Rodrigo Gallego, Lluís Masanes, Gonzalo de la Torre +3 more

arXiv:1210.6514•Nature Communications•Oct 30, 2013•196 citations

The common randomness capacity of a network of discrete memoryless channels

Sivarama Venkatesan, Venkat Anantharam

We generalize our previous results on generating common randomness at two terminals to a situation where any finite number of agents, interconnected by an arbitrary network of independent, point-to-point, discrete memoryless channels, wish to generate common randomness by interactive communication over the network. Our main result is an exact characterization of the common randomness capacity of such a network, i.e., the maximum number of bits of randomness that all the agents can agree on per step of communication. As a by-product, we also obtain a purely combinatorial result, viz., a characterization of (the incidence vectors of) the spanning arborescences rooted at a specified vertex in a digraph, and having exactly one edge exiting the root, as precisely the extreme points of a certain unbounded convex polyhedron, described by a system of linear inequalities.

IEEE Transactions on Information Theory•Mar 1, 2000•22 citations

Joint Multiple-Access and Channel Intrinsic Randomness

友彦 植松, Tomohiko Uyematsu, 哲直 松田 +1 more

•Oct 1, 2019•0 citations
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].
We generalize our previous results on generating common randomness at two terminals to a situation where any finite number of agents, interconnected by an arbitrary network of independent, point-to-point, discrete memoryless channels, wish to generate common randomness by interactive communication over the network. Our main result is an exact characterization of the common randomness capacity of such a network, i.e., the maximum number of bits of randomness that all the agents can agree on per step of communication. As a by-product, we also obtain a purely combinatorial result, viz., a characterization of (the incidence vectors of) the spanning arborescences rooted at a specified vertex in a digraph, and having exactly one edge exiting the root, as precisely the extreme points of a certain unbounded convex polyhedron, described by a system of linear inequalities.