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

arXiv:2607.27434

The Capacity Region of the Broadcast Channel with Non-Signaling Assistance

Yuhang Yao, Syed A. Jafar

cs.ITquant-phSubmitted Jul 29, 2026• Announced Jul 31, 2026• 1 citation
arXivHTMLPDF

Abstract

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. 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, where each bound corresponds to full cooperation among that subset of receivers under a worst-case joint channel law consistent with the marginal channels.

Related papers

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

Yuhang Yao, Syed A. Jafar

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.

cs.ITCross-listedarXiv:2608.13860•Aug 17, 2026•1 citation

Virtual Signaling of CSIT via Non-Signaling Assistance

Yuhang Yao, Syed A. Jafar

Non-signaling correlations, which (strictly) include quantum correlations, provide a tractable path to explore the potential impact of quantum nonlocality on the capacity of classical communication networks. Motivated by a recent discovery that certain wireless network settings benefit significantly from non-signaling (NS) correlations, various generalizations are considered. First, it is shown that for a point to point discrete memoryless channel with a non-causal channel state information at the transmitter (CSIT), the NS-assisted Shannon capacity matches the classical (without NS assistance) capacity of the channel for the setting where the state is also made available to the receiver. The key insight is summarized as 'virtual signaling of CSIT via NS-assistance' and is supported by further results as follows. For a discrete memoryless 2-user broadcast channel (BC), the Shannon capacity region with NS-assistance available only between the transmitter and User 1, is found next. Consistent with the aforementioned key insight, the result matches the classical capacity region for the setting where the desired message of User 2 is made available in advance as side-information to User 1. The latter capacity region is known from a result of Kramer and Shamai. Next, for a semi-deterministic BC, the Shannon capacity region with full (tripartite) NS-assistance is shown to be the same as if only bipartite NS-assistance was available between the transmitter and the non-deterministic user. Bipartite NS-assistance between the transmitter and only the deterministic user, does not improve the capacity region relative to the corresponding classical setting. Finally, the analysis is extended to a K-user BC with full NS-assistance among all parties.

arXiv:2506.17803•IEEE Transactions on Information Theory•Aug 10, 2026•5 citations

Non-signaling Assisted Capacity of a Classical Channel with Causal CSIT

Yuhang Yao, Syed A. Jafar

The non-signaling (NS) assisted capacity of a classical discrete memoryless channel with causal channel state information at the transmitter (CSIT) is shown to be $C^{NS,ca}=\max_{P_{X|S}}I(X;Y\mid S)$, where $X, Y, S$ correspond to the input, output and state of the channel. Remarkably, this is the same as the capacity of the channel in the NS-assisted non-causal CSIT setting, $C^{NS,nc}=\max_{P_{X|S}}I(X;Y\mid S)$, which was previously established, and also matches the (either classical or with NS assistance) capacity of the channel where the state is available not only (either causally or non-causally) to the transmitter but also to the receiver. While the capacity remains unchanged, the optimal probability of error for fixed message size and blocklength, in the NS-assisted causal CSIT setting can be further improved if channel state is made available to the receiver. This is in contrast to corresponding NS-assisted non-causal CSIT setting where it was previously noted that the optimal probability of error cannot be further improved by providing the state to the receiver. As a separate result we prove that non-signaling assistance, feedback, and strictly causal CSIT (i.e., transmitter knows only past channel states but not the current or future states), each of which is individually already known to not increase capacity, also cannot increase capacity when they are collectively made available to the transmitter.

arXiv:2602.11568•Feb 12, 2026•3 citations

Random Coding Bound for Secrecy E-capacity Region of the Broadcast Channel With Two Confidential Messages

Nasrin Afshar, Evgueni Haroutunian, Mariam E. Haroutunian

We study secrecy E-capacity region of the discrete memoryless broadcast channel with two independent confidential messages sent to two receivers (BC-2CM). The system involves two sources, one encoder, two discrete memoryless channels and two receivers. Each private message is sent to the corresponding receiver while keeping the other receiver in total ignorance of it. The level of ignorance is measured by the equivocation rate. E-capacity region is the set of rate pairs R1; R2 of codes with given error probability exponents (reliabilities) E1; E2 at respective receivers. We derived a random coding bound for secrecy E-capacity region of the BC-2CM. When error probability exponents are going to zero, this bound coincides with the inner bound of secrecy capacity region of the BC-2CM obtained by R. Liu, I. Maric, P. Spasojevic and R. Yates.

Mathematical Problems of Computer Science•Apr 25, 2012•0 citations

Semi-deterministic Broadcast Channel With Side Information: A Secrecy Capacity Outer Bound

Saeid Pakravan, Ghosheh Abed Hodtani

In this study, we obtain an outer bound on the secrecy capacity region of a two-user semi-deterministic discrete memoryless broadcast channel with considering side-information available at the transmitter, where, the sender contain two independent confidential messages, each one is deliberated for one of the receivers but is kept entirely secret from the other. Further, we compare obtained outer bound via the specified secrecy capacity outer bound of the semi-deterministic broadcast channel without side information and without secrecy constraint; specifically, the side information impact on the outer bound is explained.

International Conference on Computer and Knowledge Engineering•Oct 29, 2020•2 citations

Capacity of Cognitive Interference Channels With and Without Secrecy

Yingbin Liang, Anelia Somekh-Baruch, H. Vincent Poor +2 more

Like the conventional two-user interference channel, the cognitive interference channel consists of two transmitters whose signals interfere at two receivers. It is assumed that there is a common message (message 1) known to both transmitters, and an additional independent message (message 2) known only to the cognitive transmitter (transmitter 2). The cognitive receiver (receiver 2) needs to decode messages 1 and 2, while the non cognitive receiver (receiver 1) should decode only message 1. Furthermore, message 2 is assumed to be a confidential message which needs to be kept as secret as possible from receiver 1, which is viewed as an eavesdropper with regard to message 2. The level of secrecy is measured by the equivocation rate. In this paper, a single-letter expression for the capacity-equivocation region of the discrete memoryless cognitive interference channel is obtained. The capacity-equivocation region for the Gaussian cognitive interference channel is also obtained explicitly. Moreover, particularizing the capacity-equivocation region to the case without a secrecy constraint, the capacity region for the two-user cognitive interference channel is obtained, by providing a converse theorem.

IEEE Transactions on Information Theory•Feb 1, 2009•177 citations
The capacity region of the KKK-user discrete memoryless broadcast channel is fully characterized when non-signaling (NS) assistance is available to the transmitter and all KKK receivers. 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, where each bound corresponds to full cooperation among that subset of receivers under a worst-case joint channel law consistent with the marginal channels.
The capacity region of the KKK-sender discrete memoryless multiple access channel (MAC) is fully characterized when non-signaling (NS) assistance is available to all KKK 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 KKK senders of an outer bound that was previously established by Fawzi and Fermé for K=2K=2K=2 senders. Additionally, we provide examples of KKK-sender MACs where the multiplicative gain in capacity from NS-assistance is arbitrarily close to KKK. Combined with an upper bound from prior work, this establishes KKK as the extremal value of the multiplicative gain from NS-assistance across all KKK-sender MAC settings.
Non-signaling correlations, which (strictly) include quantum correlations, provide a tractable path to explore the potential impact of quantum nonlocality on the capacity of classical communication networks. Motivated by a recent discovery that certain wireless network settings benefit significantly from non-signaling (NS) correlations, various generalizations are considered. First, it is shown that for a point to point discrete memoryless channel with a non-causal channel state information at the transmitter (CSIT), the NS-assisted Shannon capacity matches the classical (without NS assistance) capacity of the channel for the setting where the state is also made available to the receiver. The key insight is summarized as 'virtual signaling of CSIT via NS-assistance' and is supported by further results as follows. For a discrete memoryless 2-user broadcast channel (BC), the Shannon capacity region with NS-assistance available only between the transmitter and User 1, is found next. Consistent with the aforementioned key insight, the result matches the classical capacity region for the setting where the desired message of User 2 is made available in advance as side-information to User 1. The latter capacity region is known from a result of Kramer and Shamai. Next, for a semi-deterministic BC, the Shannon capacity region with full (tripartite) NS-assistance is shown to be the same as if only bipartite NS-assistance was available between the transmitter and the non-deterministic user. Bipartite NS-assistance between the transmitter and only the deterministic user, does not improve the capacity region relative to the corresponding classical setting. Finally, the analysis is extended to a K-user BC with full NS-assistance among all parties.
The non-signaling (NS) assisted capacity of a classical discrete memoryless channel with causal channel state information at the transmitter (CSIT) is shown to be CNS,ca=max⁡PX∣SI(X;Y∣S)C^{NS,ca}=\max_{P_{X|S}}I(X;Y\mid S)CNS,ca=maxPX∣S​​I(X;Y∣S), where X,Y,SX, Y, SX,Y,S correspond to the input, output and state of the channel. Remarkably, this is the same as the capacity of the channel in the NS-assisted non-causal CSIT setting, CNS,nc=max⁡PX∣SI(X;Y∣S)C^{NS,nc}=\max_{P_{X|S}}I(X;Y\mid S)CNS,nc=maxPX∣S​​I(X;Y∣S), which was previously established, and also matches the (either classical or with NS assistance) capacity of the channel where the state is available not only (either causally or non-causally) to the transmitter but also to the receiver. While the capacity remains unchanged, the optimal probability of error for fixed message size and blocklength, in the NS-assisted causal CSIT setting can be further improved if channel state is made available to the receiver. This is in contrast to corresponding NS-assisted non-causal CSIT setting where it was previously noted that the optimal probability of error cannot be further improved by providing the state to the receiver. As a separate result we prove that non-signaling assistance, feedback, and strictly causal CSIT (i.e., transmitter knows only past channel states but not the current or future states), each of which is individually already known to not increase capacity, also cannot increase capacity when they are collectively made available to the transmitter.
We study secrecy E-capacity region of the discrete memoryless broadcast channel with two independent confidential messages sent to two receivers (BC-2CM). The system involves two sources, one encoder, two discrete memoryless channels and two receivers. Each private message is sent to the corresponding receiver while keeping the other receiver in total ignorance of it. The level of ignorance is measured by the equivocation rate. E-capacity region is the set of rate pairs R1; R2 of codes with given error probability exponents (reliabilities) E1; E2 at respective receivers. We derived a random coding bound for secrecy E-capacity region of the BC-2CM. When error probability exponents are going to zero, this bound coincides with the inner bound of secrecy capacity region of the BC-2CM obtained by R. Liu, I. Maric, P. Spasojevic and R. Yates.
In this study, we obtain an outer bound on the secrecy capacity region of a two-user semi-deterministic discrete memoryless broadcast channel with considering side-information available at the transmitter, where, the sender contain two independent confidential messages, each one is deliberated for one of the receivers but is kept entirely secret from the other. Further, we compare obtained outer bound via the specified secrecy capacity outer bound of the semi-deterministic broadcast channel without side information and without secrecy constraint; specifically, the side information impact on the outer bound is explained.
Like the conventional two-user interference channel, the cognitive interference channel consists of two transmitters whose signals interfere at two receivers. It is assumed that there is a common message (message 1) known to both transmitters, and an additional independent message (message 2) known only to the cognitive transmitter (transmitter 2). The cognitive receiver (receiver 2) needs to decode messages 1 and 2, while the non cognitive receiver (receiver 1) should decode only message 1. Furthermore, message 2 is assumed to be a confidential message which needs to be kept as secret as possible from receiver 1, which is viewed as an eavesdropper with regard to message 2. The level of secrecy is measured by the equivocation rate. In this paper, a single-letter expression for the capacity-equivocation region of the discrete memoryless cognitive interference channel is obtained. The capacity-equivocation region for the Gaussian cognitive interference channel is also obtained explicitly. Moreover, particularizing the capacity-equivocation region to the case without a secrecy constraint, the capacity region for the two-user cognitive interference channel is obtained, by providing a converse theorem.