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

TL;DR

This paper investigates the capacity limits of memoryless finite-state multiple access channels with asymmetric noisy state information at the encoders and full state knowledge at the receiver, providing tight bounds for the sum-rate capacity.

Contribution

It introduces single-letter inner and outer bounds for the capacity of FS-MACs with asymmetric noisy state information, establishing the tightness of the sum-rate capacity bounds.

Findings

Inner and outer bounds for capacity are derived.

The outer bound is shown to be tight for the sum-rate capacity.

Results apply to channels with i.i.d. state processes.

Abstract

We consider the capacity of memoryless finite-state multiple access channel (FS-MAC) with causal asymmetric noisy state information available at both transmitters and complete state information available at the receiver. Single letter inner and outer bounds are provided for the capacity of such channels when the state process is independent and identically distributed. The outer bound is attained by observing that the proposed inner bound is tight for the sum-rate capacity.