pith. sign in

arxiv: 2606.12839 · v1 · pith:V4BWVNISnew · submitted 2026-06-11 · 💻 cs.IT · math.IT

The Capacity Region for Classes of Sum-Broadcast Channels

Amin Gohari , Yi Liu , Chandra Nair This is my paper

Pith reviewed 2026-06-27 06:05 UTC · model grok-4.3

classification 💻 cs.IT math.IT
keywords broadcast channelscapacity regionMarton's inner boundauxiliary receiversum channelsdegraded channelsdeterministic channels
0
0 comments X

The pith

The capacity region of sums of broadcast channels is determined exactly when each component is degraded, less-noisy, more-capable, deterministic or semi-deterministic.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves that the capacity region of a sum of broadcast channels can be found exactly when the individual channels belong to the classes of degraded, less-noisy, more-capable, deterministic, or semi-deterministic channels. It does so by establishing equality between a previously introduced auxiliary-receiver outer bound and Marton's inner bound. The same equality holds for a newly defined class of primary broadcast channels. This extends an earlier result limited to the sum of two reversely degraded broadcast channels.

Core claim

For the sum of broadcast channels whose components are degraded, less-noisy, more-capable, deterministic, or semi-deterministic, the auxiliary-receiver outer bound coincides with Marton's inner bound and therefore gives the capacity region. An analogous result holds for the sum of primary broadcast channels.

What carries the argument

The auxiliary-receiver outer bound, shown to equal Marton's inner bound on the sum channel when the component channels satisfy the listed structural properties.

If this is right

  • The capacity region is characterized for every sum whose components lie in the listed classes.
  • The 1980 result on sums of two reversely degraded broadcast channels is recovered as a special case.
  • An identical capacity result applies to sums of primary broadcast channels.
  • The equality of the two bounds supplies an explicit description of all achievable rate triples for these sums.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The technique may extend to other multi-user settings built from components that individually admit tight inner-outer bound pairs.
  • Sums involving Gaussian broadcast channels could be examined next to test whether similar bound equality occurs.
  • The definition of primary broadcast channels opens a route to capacity results for additional structured families.

Load-bearing premise

Each individual broadcast channel in the sum must belong to one of the classes (degraded, less-noisy, more-capable, deterministic, semi-deterministic, or primary) that forces the auxiliary-receiver outer bound to match Marton's inner bound.

What would settle it

A concrete pair of degraded broadcast channels whose sum yields a strictly smaller achievable region under Marton's inner bound than the auxiliary-receiver outer bound.

Figures

Figures reproduced from arXiv: 2606.12839 by Amin Gohari, Chandra Nair, Yi Liu.

Figure 1
Figure 1. Figure 1: Two-receiver broadcast communication system. [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Venn diagram of broadcast channel classes. [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: A reversely semi-deterministic sum broadcast channel. [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗
read the original abstract

We compute the capacity region of a sum of broadcast channels whose components are degraded, less-noisy, more-capable, deterministic, or semi-deterministic. We achieve this by showing that an auxiliary-receiver outer bound, previously introduced by some of the authors, matches Marton's inner bound. This result generalizes a previously known result for the sum of two reversely degraded broadcast channels due to El Gamal (1980). Moreover, we define a class of primary broadcast channels and show an analogous result for the sum of primary broadcast channels.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 1 minor

Summary. The manuscript claims to compute the capacity region of a sum of broadcast channels whose components are degraded, less-noisy, more-capable, deterministic, or semi-deterministic by showing that an auxiliary-receiver outer bound matches Marton's inner bound. This generalizes El Gamal's 1980 result on reversely degraded pairs. The authors also define a class of primary broadcast channels and establish an analogous capacity result for their sums.

Significance. If the bound-matching holds under the stated structural conditions on the component channels, the result supplies exact capacity regions for sums of broadcast channels in several standard classes, extending a classical result without introducing fitted parameters or self-referential definitions. The approach of leveraging component properties to equate the auxiliary-receiver outer bound with Marton's inner bound is a clear technical contribution to multi-user information theory.

minor comments (1)
  1. [Abstract] Abstract: the phrase 'previously introduced by some of the authors' for the auxiliary-receiver outer bound should include an explicit citation to the prior work to improve traceability.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary, significance assessment, and recommendation of minor revision. No major comments appear in the report, so we have no specific points requiring response or rebuttal.

Circularity Check

0 steps flagged

Minor self-citation of outer bound; no load-bearing circularity in matching argument

full rationale

The derivation proceeds by applying a previously introduced auxiliary-receiver outer bound (cited to prior work by some of the present authors) and showing it equals Marton's inner bound for sum channels whose components satisfy the listed structural properties (degraded, less-noisy, etc.). This self-citation is not load-bearing for the central claim, which is the matching itself and its generalization of El Gamal (1980). No self-definitional equivalence, fitted parameter renamed as prediction, uniqueness theorem imported from the same authors, or other enumerated circular patterns appear. The argument is self-contained against the structural assumptions on the component channels and does not reduce to its own inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The result rests on standard information-theoretic definitions and inequalities for the listed channel classes; no free parameters, invented entities, or ad-hoc axioms are indicated in the abstract.

axioms (1)
  • domain assumption Standard definitions and properties of degraded, less-noisy, more-capable, deterministic and semi-deterministic broadcast channels from prior literature
    The equality of bounds is claimed to hold precisely when components belong to these classes.

pith-pipeline@v0.9.1-grok · 5606 in / 1319 out tokens · 21805 ms · 2026-06-27T06:05:42.856360+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

26 extracted references · 1 linked inside Pith

  1. [1]

    Ahlswede and J

    R. Ahlswede and J. K ¨orner,Source coding with side information and a converse for degraded broadcast channels, IEEE Transactions on Information Theory21(1975), no. 6, 629–637

    1975

  2. [2]

    3, 1361–1371

    Venkat Anantharam, Amin Gohari, and Chandra Nair,On the evaluation of marton’s inner bound for two-receiver broadcast channels, IEEE Transactions on Information Theory65(2018), no. 3, 1361–1371

    2018

  3. [3]

    3, 1361–1371

    ,On the evaluation of Marton’s inner bound for two-receiver broadcast channels, IEEE Transactions on Information Theory65(2019), no. 3, 1361–1371

    2019

  4. [4]

    Bergmans,Random coding theorem for broadcast channels with degraded components, IEEE Transactions on Information Theory19(1973), no

    P. Bergmans,Random coding theorem for broadcast channels with degraded components, IEEE Transactions on Information Theory19(1973), no. 2, 197–207

    1973

  5. [5]

    Z. Chen, A. Gohari, and C. Nair,A differential equation approach to the most-informative boolean function conjecture, arXiv preprint arXiv:2502.10019 (2025)

    arXiv 2025

  6. [6]

    3, 439–441

    Max Costa,Writing on dirty paper (corresp.), IEEE transactions on information theory29(1983), no. 3, 439–441

    1983

  7. [7]

    Cover,Broadcast channels, IEEE Transactions on Information Theory18(1972), no

    T. Cover,Broadcast channels, IEEE Transactions on Information Theory18(1972), no. 1, 2–14

    1972

  8. [8]

    El Gamal,The capacity of a class of broadcast channels, IEEE Transactions on Information Theory25(1979), no

    A. El Gamal,The capacity of a class of broadcast channels, IEEE Transactions on Information Theory25(1979), no. 2, 166–169

    1979

  9. [9]

    Peredachi Inf

    ,Capacity of the product and sum of two unmatched broadcast channels, Probl. Peredachi Inf. (1980), 3–23

    1980

  10. [10]

    El Gamal, A

    A. El Gamal, A. Gohari, and C. Nair,A strengthened cutset upper bound on the capacity of the relay channel and applications, IEEE Trans. Inf. Theory 68(2022), no. 8, 5013–5043

    2022

  11. [11]

    El Gamal and Y

    A. El Gamal and Y . Kim,Network information theory, Cambridge University Press, USA, 2012

    2012

  12. [12]

    R. G. Gallager,Capacity and coding for degraded broadcast channels, Probl. Peredachi Inf.10(1974), no. 3, 3–14

    1974

  13. [13]

    Geng and C

    Y . Geng and C. Nair,The capacity region of the two-receiver gaussian vector broadcast channel with private and common messages, IEEE Transactions on Information Theory60(2014), no. 4, 2087–2104

    2014

  14. [14]

    1, 22–41

    Yanlin Geng, Amin Gohari, Chandra Nair, and Yuanming Yu,On marton’s inner bound and its optimality for classes of product broadcast channels, IEEE Transactions on Information Theory60(2014), no. 1, 22–41

    2014

  15. [15]

    Gohari, C

    A. Gohari, C. Nair, and J. Zhao,On the capacity region of some classes of interference channels, 2024 IEEE International Symposium on Information Theory (ISIT), 2024, pp. 3136–3141

    2024

  16. [16]

    2, 701–736

    Amin Gohari and Chandra Nair,Outer bounds for multiuser settings: The auxiliary receiver approach, IEEE Transactions on Information Theory68 (2022), no. 2, 701–736

    2022

  17. [17]

    Csiszr and P

    J K ¨orner and K Marton,Comparison of two noisy channels, Topics in Information Theory, I. Csiszr and P. Elias, Eds., Amsterdam, The Netherlans (1977), 411–423

    1977

  18. [18]

    Marton,A coding theorem for the discrete memoryless broadcast channel, IEEE Transactions on Information Theory25(1979), no

    K. Marton,A coding theorem for the discrete memoryless broadcast channel, IEEE Transactions on Information Theory25(1979), no. 3, 306–311

    1979

  19. [19]

    Nair,A note on outer bounds for broadcast channel, CoRRabs/1101.0640(2011)

    C. Nair,A note on outer bounds for broadcast channel, CoRRabs/1101.0640(2011)

    Pith/arXiv arXiv 2011

  20. [20]

    1839–1843

    Chandra Nair,Capacity regions of two new classes of 2-receiver broadcast channels, 2009 IEEE International Symposium on Information Theory, IEEE, 2009, pp. 1839–1843

    2009

  21. [21]

    ,Capacity regions of two new classes of two-receiver broadcast channels, Information Theory, IEEE Transactions on56(2010), 4207 – 4214

    2010

  22. [22]

    1, 12–20

    ,Upper concave envelopes and auxiliary random variables, International Journal of Advances in Engineering Sciences and Applied Mathematics 5(2013), no. 1, 12–20

    2013

  23. [23]

    Chandra Nair, Hyeji Kim, and Abbas El Gamal,On the optimality of randomized time division and superposition coding for the broadcast channel, 2016 IEEE Information Theory Workshop (ITW), Sept 2016, pp. 131–135

    2016

  24. [24]

    M. S. Pinsker S. I. Gel’fand,Capacity of a broadcast channel with one deterministic component, Probl. Peredachi Inf. (1980), no. 1, 17–25

    1980

  25. [25]

    Weingarten, Y

    H. Weingarten, Y . Steinberg, and S.S. Shamai,The capacity region of the gaussian multiple-input multiple-output broadcast channel, IEEE Transactions on Information Theory52(2006), no. 9, 3936–3964

    2006

  26. [26]

    Wen and A

    Z. Wen and A. Gohari,A new upper bound for distributed hypothesis testing using the auxiliary receiver approach, arXiv preprint arXiv:2409.14148 (2024). 16 APPENDIXA PROOFSTHATTHREECLASSES OFBROADCASTCHANNELSAREPRIMARY A. More-Capable Broadcast Channels Belong to ˆP λ0,λ1,λ2 SupposeZ M.C. ⪰Y. We first show that (12a) holds. For anyλ 0 ≥λ 1 ≥λ 2 ≥0, we hav...

    arXiv 2024