Metraipolis › archive › dc_608cda257337

Capacity of a Mixed Multiple-Access Channel with Causal Observation — arXiv:2609.22391

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.22391
License (as archived)
CC0-1.0
Archived
2026-10-09T21:55:22.976Z
SHA-256 of the archived text
99910d15116b8601cafc0a1f4b3c6009c7393beb18f8a6b97b2fe70f332928e9
Stable URL of this page
https://metraipolis.com/documento/dc_608cda257337

How to cite

Capacity of a Mixed Multiple-Access Channel with Causal Observation — arXiv:2609.22391 — arXiv (en), https://arxiv.org/abs/2609.22391 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_608cda257337 (Metraipolis archive dc_608cda257337, sha256 99910d15116b8601cafc0a1f4b3c6009c7393beb18f8a6b97b2fe70f332928e9)
BibTeX
@misc{dc608cda257337,
  title = {Capacity of a Mixed Multiple-Access Channel with Causal Observation — arXiv:2609.22391},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.22391},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_608cda257337; sha256 99910d15116b8601cafc0a1f4b3c6009c7393beb18f8a6b97b2fe70f332928e9},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.22391. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We determine the capacity region of a mixed binary multiple-access channel whose receiver can choose how each observation is formed. Two ports reveal the sum modulo two of the transmitted symbols with retention probabilities $\pg>\pb$; their roles are interchanged by an unknown state that remains fixed during the block. With one observation per channel use, no transmitter feedback, and zero switching cost, the region is $R_1+R_2\le\pg$ for every fixed error threshold below one, and a strong converse holds. For error thresholds below one half, the largest open-loop sum rate is $(\pg+\pb)/2$, whereas a fixed port permits only $\pb$. A causal receiver attains the larger region by learning the state from erasure flags while using every channel use for data. A posterior port rule makes only finitely many incorrect selections almost surely, with a uniformly bounded expected number of mistakes. Exact random linear-code formulas and output-counting converses quantify the finite-block consequences. At blocklength 256 with $(\pg,\pb)=(0.9,0.4)$, independent numerical validation supports 214 message bits at a one-percent ensemble failure target, compared with 148 bits for the best open-loop allocation in the same code ensemble. The resulting 44.59\% increase is achieved with the same transmission and observation budgets. The analysis exhibits an explicit capacity gain from controlling the observation axis and separates that gain from information lost after a record has already been formed.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.22391 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T21:44:07.444Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).