Paperlane

no. 6 · Monday 2 November 2026

Rates and Nearly-Lossless State over a Multi-Access Channel with Causal State Information

Amos Lapidoth and Baohua Ni

math.IT · 31 pp

Abstract

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.

comments
31 pages, 2 figures
fields
Information Theory
pdf ↗ page arXiv:2610.41860 ↗