One-Shot Broadcast Joint Source-Channel Coding with Codebook Diversity

Ashish Khisti; Buu Phan; Joseph Rowan

arxiv: 2601.10648 · v3 · submitted 2026-01-15 · 💻 cs.IT · math.IT

One-Shot Broadcast Joint Source-Channel Coding with Codebook Diversity

Joseph Rowan , Buu Phan , Ashish Khisti This is my paper

Pith reviewed 2026-05-16 13:56 UTC · model grok-4.3

classification 💻 cs.IT math.IT

keywords one-shot joint source-channel codingbroadcast communicationcodebook diversityPoisson matching lemmahybrid coding schemebinary symmetric channeldistortion constraintachievability bounds

0 comments

The pith

Disjoint codebooks at decoders provide a distinct diversity gain in one-shot broadcast joint source-channel coding.

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

The paper examines a setting where a single encoded source is broadcast to multiple decoders over independent channels, with success defined by at least one decoder achieving the target distortion. It shows that assigning disjoint codebooks to the decoders produces a codebook diversity gain in the one-shot regime, separate from any gain due to independent channel outputs. Achievability bounds are obtained by adapting the Poisson matching lemma for multiple decoders, and a hybrid scheme grouping decoders to mix shared and disjoint codebooks is proposed. Numerical evaluations on the binary symmetric channel indicate that this hybrid approach yields better performance than using either fully shared or fully disjoint codebooks.

Core claim

In the one-shot broadcast joint source-channel coding problem, where an encoder transmits once to K decoders over independent channels and the goal is that at least one decoder reconstructs the source within a maximum allowed distortion, the use of disjoint codebooks across decoders achieves a codebook diversity gain that is distinct from the channel diversity gain obtainable with a shared codebook and independent channel realizations. This gain is quantified through first- and second-order achievability bounds derived from an adapted Poisson matching lemma that accommodates multiple disjoint codebooks, and a hybrid coding scheme that partitions the decoders into groups is shown to optimally

What carries the argument

An adaptation of the Poisson matching lemma that supports multiple decoders using disjoint codebooks, which quantifies the codebook diversity gain in the one-shot regime.

If this is right

Hybrid partitioning of decoders into groups balances codebook diversity and channel diversity to improve overall success probability.
First- and second-order bounds establish the achievability of the codebook diversity effect.
Simulations on the binary symmetric channel confirm that hybrid schemes outperform both fully shared and fully disjoint codebook strategies.
The codebook diversity gain is available even when channel outputs are independent, providing an additional mechanism for reliability.

Where Pith is reading between the lines

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

Codebook assignment strategies in multi-receiver broadcast settings may benefit from explicit consideration of disjointness to exploit this diversity.
Similar disjoint-codebook techniques could be tested in other one-shot multi-user communication models with independent links.
The hybrid approach suggests a design principle for trading off between codebook reuse and diversity in resource-constrained broadcast scenarios.

Load-bearing premise

The adaptation of the Poisson matching lemma to multiple decoders with disjoint codebooks introduces no additional error terms large enough to cancel the claimed codebook diversity gain.

What would settle it

Numerical simulations or exact computation of the error probability for small blocklengths on the binary symmetric channel showing no improvement from disjoint codebooks over shared codebooks beyond what independent channels already provide.

Figures

Figures reproduced from arXiv: 2601.10648 by Ashish Khisti, Buu Phan, Joseph Rowan.

**Figure 2.** Figure 2: Comparison of achievable rates with K decoders for a BSC with crossover probability δ = 0.05, error tolerance ε = 10−2 and n ∈ {10, 20}. The disjoint (DJ), baseline (BL) and hybrid (HY) schemes are shown. short blocklengths n ∈ {10, 20}, K between 1 and 1024, δ = 0.05 and error tolerance ε = 10−2 . While the baseline performs well for small K, its performance saturates. Intuitively, as K becomes large wit… view at source ↗

read the original abstract

We study a one-shot joint source-channel coding setting where the source is encoded once and broadcast to $K$ decoders through independent channels. Success is predicated on at least one decoder recovering the source within a maximum distortion constraint. We find that in the one-shot regime, utilizing disjoint codebooks at each decoder yields a codebook diversity gain, distinct from the channel diversity gain that may be expected when several decoders observe independent realizations of the channel's output but share the same codebook. Coding schemes are introduced that leverage this phenomenon, where first- and second-order achievability bounds are derived via an adaptation of the Poisson matching lemma which allows for multiple decoders using disjoint codebooks. We further propose a hybrid coding scheme that partitions decoders into groups to optimally balance codebook and channel diversity. Numerical results on the binary symmetric channel demonstrate that the hybrid approach outperforms strategies where the decoders' codebooks are either fully shared or disjoint.

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.

Desk Editor's Note private letter to a colleague

The paper shows a codebook diversity gain from disjoint codebooks in one-shot broadcast JSCC and a hybrid scheme to balance it with channel diversity, but the key lemma adaptation may need tighter error analysis.

read the letter

This paper's key point is that in one-shot joint source-channel coding for broadcast, giving each decoder its own disjoint codebook creates a codebook diversity gain on top of any channel diversity from independent realizations. They back this with an adapted Poisson matching lemma for the achievability bounds and introduce a hybrid scheme that splits decoders into groups to trade off the two. The work does a clean job separating those two diversity sources, which prior work apparently didn't highlight in this setting. The hybrid partitioning looks practical for balancing reliability, and the BSC examples indicate it beats the all-shared and all-disjoint baselines. It's a targeted tweak rather than a broad new framework, but the distinction is useful for thinking about one-shot reliability. The main question mark is whether the lemma adaptation fully controls the error terms when unioning over the disjoint codebooks. If an extra factor depending on K sneaks in, it could erase the claimed gain in the one-shot limit. The abstract doesn't spell out the precise bounds, so that part needs checking in the full derivation. The numerics are reported without complete parameter lists, which makes it harder to reproduce the exact gains. Still, the central claim holds up at the level of the abstract, and the hybrid idea is a reasonable way to optimize. This is aimed at researchers in finite-blocklength information theory and low-latency broadcast applications. Someone already working on JSCC bounds would find the distinction useful and the hybrid idea worth testing. It has enough structure and a concrete scheme to merit peer review, even if the bounds need tightening.

Referee Report

1 major / 2 minor

Summary. The paper studies one-shot broadcast joint source-channel coding where a source is encoded once and sent to K decoders over independent channels, with success defined as at least one decoder recovering the source within a maximum distortion. It claims that disjoint codebooks yield a distinct 'codebook diversity gain' separate from channel diversity (arising from independent channel realizations with a shared codebook). First- and second-order achievability bounds are obtained by adapting the Poisson matching lemma to multiple disjoint codebooks; a hybrid scheme partitions decoders into groups to balance the two diversity types; and BSC numerical results show the hybrid outperforming fully shared or fully disjoint baselines.

Significance. If the Poisson-matching adaptation is shown to preserve the claimed gain without K-dependent error terms that cancel the improvement, the work would usefully separate codebook-level and channel-level diversity mechanisms in the one-shot regime and supply concrete hybrid constructions with supporting bounds and simulations. The numerical BSC comparison provides initial evidence of practical benefit, though the bounds' rigor is the load-bearing element.

major comments (1)

[Achievability bounds (Poisson-matching adaptation)] The adaptation of the Poisson matching lemma to K decoders with completely disjoint codebooks (used for the first- and second-order achievability bounds) requires an explicit error-term analysis showing that any union-bound or dependence penalty scales in a way that does not erase the codebook-diversity improvement over the shared-codebook case; the abstract and derivation sketch do not exhibit this control, which is central to validating the main claim.

minor comments (2)

Numerical BSC results are reported without complete parameter tables (blocklength n, distortion D, crossover probability p, and exact codebook sizes), hindering direct verification and comparison.
The distinction between 'codebook diversity gain' and 'channel diversity gain' should be formalized with a short definition or inequality in the introduction to make the separation unambiguous.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the detailed review and constructive feedback on our manuscript arXiv:2601.10648. The major comment raises an important point about the rigor of the error-term control in our adaptation of the Poisson matching lemma. We address it point by point below and will incorporate clarifications and additional analysis in the revised version.

read point-by-point responses

Referee: The adaptation of the Poisson matching lemma to K decoders with completely disjoint codebooks (used for the first- and second-order achievability bounds) requires an explicit error-term analysis showing that any union-bound or dependence penalty scales in a way that does not erase the codebook-diversity improvement over the shared-codebook case; the abstract and derivation sketch do not exhibit this control, which is central to validating the main claim.

Authors: We agree that an explicit scaling analysis strengthens the presentation. In the full manuscript (Section III-B and Appendix B), the Poisson matching lemma is adapted by constructing K independent Poisson point processes, one per disjoint codebook. The probability that none of the K processes covers the source within distortion D is bounded by exp(-K * mu), where mu is the intensity measure for a single codebook; the union bound over decoders contributes only a multiplicative K factor outside the exponent. Because the codebook-diversity gain appears inside the exponent (linear in K for the covering probability), it is not canceled by the linear prefactor for any fixed K as the blocklength or rate parameters grow. For the second-order term, channel independence and codebook disjointness ensure that the variance terms add without cross-dependencies that would scale adversely with K. We will add a dedicated paragraph and a short lemma in Section III explicitly deriving these scalings and comparing them to the shared-codebook baseline (where the exponent remains independent of K). This revision will make the control fully transparent. revision: yes

Circularity Check

0 steps flagged

No significant circularity; bounds derived from external lemma adaptation

full rationale

The paper's central achievability results are obtained by adapting the Poisson matching lemma to the K-decoder disjoint-codebook setting, then optimizing a hybrid scheme over the resulting first- and second-order bounds. No step reduces a claimed prediction to a fitted parameter defined by the same equations, nor does any load-bearing premise collapse to a self-citation chain or an ansatz smuggled from prior work by the same authors. The derivation therefore remains self-contained against the external lemma and does not exhibit any of the enumerated circularity patterns.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the Poisson matching lemma (standard in information theory) and the assumption of independent channels; no new free parameters or invented entities are introduced in the abstract.

axioms (2)

domain assumption Poisson matching lemma applies to multiple decoders with disjoint codebooks
Invoked to derive first- and second-order achievability bounds for the broadcast setting.
domain assumption Channels to the K decoders are independent
Required for separating codebook diversity from channel diversity.

pith-pipeline@v0.9.0 · 5459 in / 1306 out tokens · 21771 ms · 2026-05-16T13:56:15.275777+00:00 · methodology

discussion (0)

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

Multi-Marginal Couplings for Metropolis-Hastings
stat.CO 2026-05 conditional novelty 7.0

Multi-marginal couplings combined with an adaptive shared-randomness Poisson Monte Carlo method improve coalescence rates for multiple Metropolis-Hastings chains, cutting meeting times by up to 50%.

Reference graph

Works this paper leans on

14 extracted references · 14 canonical work pages · cited by 1 Pith paper

[1]

A unified framework for one-shot achievability via the poisson matching lemma,

C. T. Li and V . Anantharam, “A unified framework for one-shot achievability via the poisson matching lemma,”IEEE Transactions on Information Theory, vol. 67, no. 5, pp. 2624–2651, 2021

work page 2021
[2]

On the error exponent of source-channel transmission with a distortion threshold,

I. Csisz ´ar, “On the error exponent of source-channel transmission with a distortion threshold,”IEEE Transactions on Information Theory, vol. 28, no. 6, pp. 823–828, 1982

work page 1982
[3]

Lossy joint source-channel coding in the finite blocklength regime,

V . Kostina and S. Verd´u, “Lossy joint source-channel coding in the finite blocklength regime,”IEEE Transactions on Information Theory, vol. 59, no. 5, pp. 2545–2575, 2013

work page 2013
[4]

Distributed detection with multiple sensors: part I — fundamentals,

R. Viswanathan and P. K. Varshney, “Distributed detection with multiple sensors: part I — fundamentals,”Proceedings of the IEEE, vol. 85, no. 1, pp. 54–63, 1997

work page 1997
[5]

Detection with distributed sensors,

R. R. Tenney and N. R. Sandell, “Detection with distributed sensors,” IEEE Transactions on Aerospace and Electronic Systems, vol. 17, no. 4, pp. 501–510, 1981

work page 1981
[6]

The rate-distortion function for source coding with side information at the decoder,

A. D. Wyner and J. Ziv, “The rate-distortion function for source coding with side information at the decoder,”IEEE Transactions on Information Theory, vol. 22, no. 1, pp. 1–10, 1976

work page 1976
[7]

Fixed-length lossy compression in the finite blocklength regime,

V . Kostina and S. Verd´u, “Fixed-length lossy compression in the finite blocklength regime,”IEEE Transactions on Information Theory, vol. 58, no. 6, pp. 3309–3338, 2012

work page 2012
[8]

Feller,An introduction to probability theory and its applications, 2nd ed

W. Feller,An introduction to probability theory and its applications, 2nd ed. New York: Wiley, 1971, vol. 2

work page 1971
[9]

Random-coding joint source-channel bounds,

A. T. Campo, G. Vazquez-Vilar, A. G. i F `abregas, and A. Martinez, “Random-coding joint source-channel bounds,” in2011 IEEE Interna- tional Symposium on Information Theory, 2011, pp. 899–902

work page 2011
[10]

Noiseless coding of correlated information sources,

D. Slepian and J. K. Wolf, “Noiseless coding of correlated information sources,”IEEE Transactions on Information Theory, vol. 19, no. 4, pp. 471–480, 1973

work page 1973
[11]

Gaussian approximations and multiplier bootstrap for maxima of sums of high-dimensional random vectors,

V . Chernozhukov, D. Chetverikov, and K. Kato, “Gaussian approximations and multiplier bootstrap for maxima of sums of high-dimensional random vectors,”The Annals of Statistics, vol. 41, no. 6, pp. 2786–2819, 2013

work page 2013
[12]

Last and M

G. Last and M. Penrose,Lectures on the Poisson Process. Cambridge: Cambridge University Press, 2017. APPENDIXA PROOF OFLEMMA1 Let us first examine the probability of the complementary event, i.e. the matching probability Pr[accept] = Pr[Up ∈ {U qk}K k=1 |U p](37) = KX k=1 Pr[Up ∈ {U qk}K k=1, Zp =k|U p](38) =KPr[U p ∈ {U qk}K k=1, Zp = 1|U p](39) where th...

work page 2017
[13]

The infimum inR(D)is attained by a uniqueP Z|W

work page
[14]

4)E (Z,W)∼P Z ×PW [d(W, Z)9]<∞

There exists a finite set ˜Z ⊆ Z which satisfies E[minz∈ ˜Z d(W, z)]<∞. 4)E (Z,W)∼P Z ×PW [d(W, Z)9]<∞. For convenience, define Ω = mX i=1 ȷW (Wi, D)+αlogm+β.(84) Examining the ensemble error event for the transmission, its probabilityP e corresponds to Pr[∩K k=1{d(W m, ˆZ m k )> D}] (a) ≤E 1+KP Zm(BD(W m))2ιXn ;Y n(X n;Y n) −1 (85) ≤Pr[−logP Zm(BD(W m))>...

work page

[1] [1]

A unified framework for one-shot achievability via the poisson matching lemma,

C. T. Li and V . Anantharam, “A unified framework for one-shot achievability via the poisson matching lemma,”IEEE Transactions on Information Theory, vol. 67, no. 5, pp. 2624–2651, 2021

work page 2021

[2] [2]

On the error exponent of source-channel transmission with a distortion threshold,

I. Csisz ´ar, “On the error exponent of source-channel transmission with a distortion threshold,”IEEE Transactions on Information Theory, vol. 28, no. 6, pp. 823–828, 1982

work page 1982

[3] [3]

Lossy joint source-channel coding in the finite blocklength regime,

V . Kostina and S. Verd´u, “Lossy joint source-channel coding in the finite blocklength regime,”IEEE Transactions on Information Theory, vol. 59, no. 5, pp. 2545–2575, 2013

work page 2013

[4] [4]

Distributed detection with multiple sensors: part I — fundamentals,

R. Viswanathan and P. K. Varshney, “Distributed detection with multiple sensors: part I — fundamentals,”Proceedings of the IEEE, vol. 85, no. 1, pp. 54–63, 1997

work page 1997

[5] [5]

Detection with distributed sensors,

R. R. Tenney and N. R. Sandell, “Detection with distributed sensors,” IEEE Transactions on Aerospace and Electronic Systems, vol. 17, no. 4, pp. 501–510, 1981

work page 1981

[6] [6]

The rate-distortion function for source coding with side information at the decoder,

A. D. Wyner and J. Ziv, “The rate-distortion function for source coding with side information at the decoder,”IEEE Transactions on Information Theory, vol. 22, no. 1, pp. 1–10, 1976

work page 1976

[7] [7]

Fixed-length lossy compression in the finite blocklength regime,

V . Kostina and S. Verd´u, “Fixed-length lossy compression in the finite blocklength regime,”IEEE Transactions on Information Theory, vol. 58, no. 6, pp. 3309–3338, 2012

work page 2012

[8] [8]

Feller,An introduction to probability theory and its applications, 2nd ed

W. Feller,An introduction to probability theory and its applications, 2nd ed. New York: Wiley, 1971, vol. 2

work page 1971

[9] [9]

Random-coding joint source-channel bounds,

A. T. Campo, G. Vazquez-Vilar, A. G. i F `abregas, and A. Martinez, “Random-coding joint source-channel bounds,” in2011 IEEE Interna- tional Symposium on Information Theory, 2011, pp. 899–902

work page 2011

[10] [10]

Noiseless coding of correlated information sources,

D. Slepian and J. K. Wolf, “Noiseless coding of correlated information sources,”IEEE Transactions on Information Theory, vol. 19, no. 4, pp. 471–480, 1973

work page 1973

[11] [11]

Gaussian approximations and multiplier bootstrap for maxima of sums of high-dimensional random vectors,

V . Chernozhukov, D. Chetverikov, and K. Kato, “Gaussian approximations and multiplier bootstrap for maxima of sums of high-dimensional random vectors,”The Annals of Statistics, vol. 41, no. 6, pp. 2786–2819, 2013

work page 2013

[12] [12]

Last and M

G. Last and M. Penrose,Lectures on the Poisson Process. Cambridge: Cambridge University Press, 2017. APPENDIXA PROOF OFLEMMA1 Let us first examine the probability of the complementary event, i.e. the matching probability Pr[accept] = Pr[Up ∈ {U qk}K k=1 |U p](37) = KX k=1 Pr[Up ∈ {U qk}K k=1, Zp =k|U p](38) =KPr[U p ∈ {U qk}K k=1, Zp = 1|U p](39) where th...

work page 2017

[13] [13]

The infimum inR(D)is attained by a uniqueP Z|W

work page

[14] [14]

4)E (Z,W)∼P Z ×PW [d(W, Z)9]<∞

There exists a finite set ˜Z ⊆ Z which satisfies E[minz∈ ˜Z d(W, z)]<∞. 4)E (Z,W)∼P Z ×PW [d(W, Z)9]<∞. For convenience, define Ω = mX i=1 ȷW (Wi, D)+αlogm+β.(84) Examining the ensemble error event for the transmission, its probabilityP e corresponds to Pr[∩K k=1{d(W m, ˆZ m k )> D}] (a) ≤E 1+KP Zm(BD(W m))2ιXn ;Y n(X n;Y n) −1 (85) ≤Pr[−logP Zm(BD(W m))>...

work page