Metraipolis › archive › dc_441fd8ad571a
Interference-Free Capacity of a Binary Interference Channel with Causal Observation — arXiv:2609.22389
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.22389
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T21:55:16.934Z
- SHA-256 of the archived text
0a4c93ad96f9b55acdd79af496203a11105a748d7a94ec3f64d14aaa95f2caca- Stable URL of this page
https://metraipolis.com/documento/dc_441fd8ad571a
How to cite
Interference-Free Capacity of a Binary Interference Channel with Causal Observation — arXiv:2609.22389 — arXiv (en), https://arxiv.org/abs/2609.22389 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_441fd8ad571a (Metraipolis archive dc_441fd8ad571a, sha256 0a4c93ad96f9b55acdd79af496203a11105a748d7a94ec3f64d14aaa95f2caca)
BibTeX
@misc{dc441fd8ad571a,
title = {Interference-Free Capacity of a Binary Interference Channel with Causal Observation — arXiv:2609.22389},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.22389},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_441fd8ad571a; sha256 0a4c93ad96f9b55acdd79af496203a11105a748d7a94ec3f64d14aaa95f2caca},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.22389. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We determine the capacity region of a two-user binary interference channel with receiver-controlled observation and prove that causal port selection attains the interference-free limit. The physical--observation dual-axis formulation makes the observation kernel a design variable subject to explicit causal and resource constraints. For two equiprobable, initially unknown block states, matching converses and coding constructions give exact sum capacities of 1, $4/3$, and 2 bits per channel use for fixed-port, open-loop, and causal policies, respectively. These results hold for every fixed joint error threshold below $1/2$, under both average and maximal message error, with error averaged over the block state. Every receiver makes one observation per slot and switches ports at most once; the transmitters receive no feedback and the receivers do not cooperate. Causal observation thus doubles the optimal fixed-port sum capacity and exceeds the optimal open-loop sum capacity by 50\%. With independent erasures of retention probability $p$, the exact causal region is $[0,p]^2$. A finite-blocklength bound accounts jointly for state-identification pilots and coding redundancy. We also optimize observation policies for fixed codes: an exact finite-horizon solution reduces message error from 10.76\% to 7.52\%, and a second-order approximation bound controls optimization over continuous observation directions. Linear-array designs and coding experiments examine the corresponding training, reliability, and control costs. The capacity result identifies a setting in which observation design removes the entire interference penalty, with the gain established by a converse as well as an achievable construction. 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.22389 — 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.442Z 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).