On the Capacity of Memoryless Finite-State Multiple-Access Channels With Asymmetric State Information at the Encoders

DOI10.1109/TIT.2011.2104570zbMATH Open1366.94229arXiv1012.1912OpenAlexW2099297578MaRDI QIDQ5281019FDOQ5281019

Authors: Giacomo Como, Serdar Yüksel 

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: A single-letter characterization is provided for the capacity region of finite-state multiple-access channels, when the channel state process is an independent and identically distributed sequence, the transmitters have access to partial (quantized) state information, and complete channel state information is available at the receiver. The partial channel state information is assumed to be asymmetric at the encoders. As a main contribution, a tight converse coding theorem is presented. The difficulties associated with the case when the channel state has memory are discussed and connections to decentralized stochastic control theory are presented.

Full work available at URL: https://arxiv.org/abs/1012.1912

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Cited In (2)

• On the symmetric information rate of two-dimensional finite-state ISI channels
• The Multiple-Access Channel With Partial State Information at the Encoders

This page was built for publication: On the Capacity of Memoryless Finite-State Multiple-Access Channels With Asymmetric State Information at the Encoders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281019)