dorsal/arxiv
View SchemaOne-Shot Broadcast Joint Source-Channel Coding with Codebook Diversity
| Authors | Joseph Rowan, Buu Phan, Ashish Khisti |
|---|---|
| Categories | |
| ArXiv ID | 2601.10648vv2 |
| URL | https://arxiv.org/abs/2601.10648 |
| License | http://creativecommons.org/licenses/by/4.0/ |
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 (Li and Anantharam, 2021) 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.
{
"annotation_id": "b4ba5365-3fad-4d45-9afa-74f77249136d",
"date_created": "2026-02-17T05:53:26.456000Z",
"date_modified": "2026-02-17T05:53:26.456000Z",
"file_hash": "1737397cdf2db548972092c26cd0751137664c7cce91b9e83e5af9f547ca0171",
"private": false,
"record": {
"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\u0027s 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 (Li and Anantharam, 2021) 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\u0027 codebooks are either fully shared or disjoint.",
"arxiv_id": "2601.10648",
"authors": [
"Joseph Rowan",
"Buu Phan",
"Ashish Khisti"
],
"categories": [
"cs.IT",
"math.IT"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "One-Shot Broadcast Joint Source-Channel Coding with Codebook Diversity",
"url": "https://arxiv.org/abs/2601.10648",
"version": "v2"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "84e94142-ea9d-45d2-a4b2-9504021d753d",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}