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

Joint Multiple-Access and Channel Intrinsic Randomness

友彦 植松, Tomohiko Uyematsu, 哲直 松田, Tetsunao Matsuta

Published Oct 1, 2019• 0 citations
OpenAlex

Related papers

Common-Randomness-Aware One-Shot Multiple Access Channel Simulation via Smooth Max-Wyner Common Information

Degala Chenchupradeep

IEEE Access•Jan 1, 2026•0 citations

Randomness in Distribution Protocols

Carlo Blundo, Alfredo De Santis, Ugo Vaccaro

Information and Computation•Dec 1, 1996•37 citations

An Achievable Rate-Distortion Region of Joint Identification and Sensing for Multiple Access Channels

Yaning Zhao, Wafa Labidi, Holger Boche +2 more

In contrast to Shannon transmission codes, the size of identification (ID) codes for discrete memoryless channels (DMCs) experiences doubly exponential growth with the block length when randomized encoding is used. Additional enhancements within the ID paradigm can be realized through supplementary resources such as quantum entanglement, common randomness (CR), and feedback. Joint transmission and sensing demonstrate significant benefits over separation-based methods. Inspired by the significant impact of feedback on the ID capacity, our work delves into the realm of joint ID and sensing (JIDAS) for state-dependent multiple access channels (SD-MACs) with noiseless strictly casual feedback. Here, the senders aim to convey ID messages to the receiver while simultaneously sensing the channel states. We establish a lower bound on the capacity-distortion region of the SD-MACs. An example shows that JIDAS outperforms the separation-based approach.

arXiv:2408.10912•Globecom•Dec 8, 2024•1 citation

Common Randomness and Secret Key Capacities of Two-Way Channels

Hadi Ahmadi, Reihaneh Safavi–Naini

Lecture notes in computer science•Jan 1, 2011•3 citations

Joint channel intrinsic randomness and channel resolvability

Alexandre J. Pierrot, Matthieu R. Bloch

This paper investigates the separation of channel intrinsic randomness and channel resolvability. We derive joint exponents, which are compared to the tandem exponents obtained with a separate approach. We prove at once, in a simple manner, achievability results for channel intrinsic randomness, random number generation, and channel resolvability. We also provide converse results in different special settings.

IEEE Information Theory Workshop (ITW)•Sep 1, 2013•7 citations

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

Rami Ezzine, Moritz Wiese, Christian Deppe +1 more

IEEE Transactions on Information Theory•Apr 30, 2025•1 citation
In contrast to Shannon transmission codes, the size of identification (ID) codes for discrete memoryless channels (DMCs) experiences doubly exponential growth with the block length when randomized encoding is used. Additional enhancements within the ID paradigm can be realized through supplementary resources such as quantum entanglement, common randomness (CR), and feedback. Joint transmission and sensing demonstrate significant benefits over separation-based methods. Inspired by the significant impact of feedback on the ID capacity, our work delves into the realm of joint ID and sensing (JIDAS) for state-dependent multiple access channels (SD-MACs) with noiseless strictly casual feedback. Here, the senders aim to convey ID messages to the receiver while simultaneously sensing the channel states. We establish a lower bound on the capacity-distortion region of the SD-MACs. An example shows that JIDAS outperforms the separation-based approach.