The Capacity Region of the Multiple Access Channel with Non-Signaling Assistance

• URL: http://arxiv.org/abs/2608.13860v1
• Date: Fri, 14 Aug 2026 01:16:21 GMT
• Title: The Capacity Region of the Multiple Access Channel with Non-Signaling Assistance
• Abstract summary: The capacity region of the $K$-sender discrete memoryless multiple access channel (MAC) is fully characterized when non-signaling (NS) assistance is available to all $K$ transmitters and the receiver.<n>It is shown to have the same form as the classical capacity region of the MAC, except that the input distribution is allowed to be arbitrarily dependent across the senders.
• Score: 12.758717256689424
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The capacity region of the $K$-sender discrete memoryless multiple access channel (MAC) is fully characterized when non-signaling (NS) assistance is available to all $K$ transmitters and the receiver. It is shown to have the same form as the classical capacity region of the MAC, except that the input distribution is allowed to be arbitrarily dependent across the senders. In particular, the NS-assisted capacity region matches the natural generalization to $K$ senders of an outer bound that was previously established by Fawzi and Fermé for $K=2$ senders. Additionally, we provide examples of $K$-sender MACs where the multiplicative gain in capacity from NS-assistance is arbitrarily close to $K$. Combined with an upper bound from prior work, this establishes $K$ as the extremal value of the multiplicative gain from NS-assistance across all $K$-sender MAC settings.

Related papers

• The entanglement-assisted transmission capacity is a strong converse bound for identification [2.0305676256390934]
  We prove that the entanglement-assisted transmission capacity $C_E$ is a strong converse bound for this task.<n>We also obtain the first example of strict superadditivity of the identification capacity $C_mathrmIDC_E$.
  arXiv  Detail & Related papers  (2026-08-11T14:48:53Z)
• The Capacity Region of the Broadcast Channel with Non-Signaling Assistance [12.758717256689424]
  The capacity region of the $K$-user discrete memoryless broadcast channel is fully characterized when non-signaling (NS) assistance is available to the transmitter and all $K$ receivers.<n>The NS-assisted capacity region is shown to coincide with Sato's region, i.e., the region defined by sum-rate bounds over all subsets of messages.
  arXiv  Detail & Related papers  (2026-07-29T20:02:47Z)
• Entanglement-Assisted Bosonic MAC: Achievable Rates and Covert Communication [13.757786051136897]
  We consider the problem of covert communication over the entanglement-assisted (EA) bosonic multiple access channel (MAC)<n>We derive a closed-form achievable rate region for the general EA bosonic MAC using high-order phase-shift keying (PSK) modulation.<n>Our analysis reveals that the joint covertness constraint imposes a linear trade-off between the senders throughput.
  arXiv  Detail & Related papers  (2026-01-29T15:37:51Z)
• Multiple-play Stochastic Bandits with Prioritized Arm Capacity Sharing [52.124267908936396]
  The model is composed of $M$ arms and $K$ plays.<n>Each arm has a number of capacities, and each unit of capacity is associated with a reward function.<n>When multiple plays compete for the arm capacity, the arm capacity is allocated in a larger priority weight first manner.
  arXiv  Detail & Related papers  (2025-12-25T11:19:09Z)
• Rydberg Atomic Quantum MIMO Receivers for The Multi-User Uplink [77.32323151235285]
  We propose a flexible architecture for Rydberg atomic quantum multiple-input multiple-output (RAQ-MIMO) receivers in the multi-user uplink.<n>The corresponding signal model of the RAQ-MIMO system is constructed by paving the way from quantum physics to wireless communications.
  arXiv  Detail & Related papers  (2025-06-02T06:16:54Z)
• Deterministic identification over channels with finite output: a dimensional perspective on superlinear rates [49.126395046088014]
  We consider the problem in its generality for memoryless channels with finite output, but arbitrary input alphabets.<n>Our main findings are that the maximum length of messages thus identifiable scales superlinearly as $R,nlog n$ with the block length $n$.<n>We show that it is sufficient to ensure pairwise reliable distinguishability of the output distributions to construct a DI code.
  arXiv  Detail & Related papers  (2024-02-14T11:59:30Z)
• The Multiple-Access Channel with Entangled Transmitters [67.92544792239086]
  Communication over a classical multiple-access channel (MAC) with entanglement resources is considered.<n>We establish inner and outer bounds on the capacity region for the general MAC with entangled transmitters.<n>Using superdense coding, entanglement can double the conferencing rate.
  arXiv  Detail & Related papers  (2023-03-18T16:51:08Z)
• Multiple-Access Channel Coding with Non-Signaling Correlations [7.215767098253206]
  We address the problem of coding for classical multiple-access channels (MACs) with the assistance of non-signaling correlations between parties. We show that using non-signaling assistance, the sum-rate $1.5425$ can be reached even with zero error. We also show that the capacity region with non-signaling assistance shared only between each sender and the receiver independently is the same as without assistance.
  arXiv  Detail & Related papers  (2022-06-22T10:36:47Z)
• The Quantum Multiple-Access Channel with Cribbing Encoders [58.3253106667749]
  Communication over a quantum multiple-access channel (MAC) with cribbing encoders is considered.<n>Based on the no-cloning theorem, perfect cribbing is impossible.<n>A partial decode-forward region is derived for a quantum MAC with non-robust cribbing.
  arXiv  Detail & Related papers  (2021-11-30T17:31:48Z)
• Bosonic quantum communication across arbitrarily high loss channels [68.58838842613457]
  A general attenuator $Phi_lambda, sigma$ is a bosonic quantum channel that acts by combining the input with a fixed environment state. We show that for any arbitrary value of $lambda>0$ there exists a suitable single-mode state $sigma(lambda)$. Our result holds even when we fix an energy constraint at the input of the channel, and implies that quantum communication at a constant rate is possible even in the limit of arbitrarily low transmissivity.
  arXiv  Detail & Related papers  (2020-03-19T16:50:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.