Metraipolis › archive › dc_7291f233ee55

Rates and Nearly-Lossless State over a Multi-Access Channel with Causal State Information — arXiv:2610.41860

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41860
License (as archived)
CC0-1.0
Archived
2026-11-02T05:01:34.038Z
SHA-256 of the archived text
da141b92716346e0bbbe0553cf135dde9482ced6d40483de15f045a0a0203b83
Stable URL of this page
https://metraipolis.com/documento/dc_7291f233ee55

How to cite

Rates and Nearly-Lossless State over a Multi-Access Channel with Causal State Information — arXiv:2610.41860 — arXiv (en), https://arxiv.org/abs/2610.41860 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7291f233ee55 (Metraipolis archive dc_7291f233ee55, sha256 da141b92716346e0bbbe0553cf135dde9482ced6d40483de15f045a0a0203b83)
BibTeX
@misc{dc7291f233ee55,
  title = {Rates and Nearly-Lossless State over a Multi-Access Channel with Causal State Information — arXiv:2610.41860},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41860},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7291f233ee55; sha256 da141b92716346e0bbbe0553cf135dde9482ced6d40483de15f045a0a0203b83},
  year = {2026}
}

Archived text

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

The problem of transmitting both data and state over a memoryless state-dependent multi-access channel with causal state information is addressed. The state comprises three independent components: a common component, which is revealed to both en- coders, and two private components, each of which is revealed to a different encoder. The data are to be recovered with arbitrarily-small probability of error, and the state sequence with arbitrarily-small symbol-error rate. Under the assumption that the capacity region in the absence of a state recon- struction constraint is nonempty, the capacity region is derived and is shown to be achievable using a Block-Markov coding scheme employing binning and superposition coding.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.41860 — 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-11-02T04:48:12.638Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).