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

TL;DR

This paper characterizes the capacity region of finite-state multiple-access channels with asymmetric partial state information at the encoders and full state information at the receiver, providing a tight converse theorem.

Contribution

It offers a single-letter capacity characterization for channels with i.i.d. states and asymmetric partial encoder information, including a tight converse coding theorem.

Findings

Single-letter capacity region characterization

Tight converse coding theorem established

Discussion on channels with memory and control theory connections

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.