Networking

Capacity of Multiple Access Channel With States Known Noncausally at One Encoder and Only Strictly Causally at the Other Encoder

Download Now Free registration required

Executive Summary

The capacity of a two-user state-dependent multiple access channel with common message and states known non-causally at only one encoder is established in, for both Discrete Memoryless (DM) and memoryless Gaussian cases. Lower and non-trivial upper bounds in the DM case and an alternative proof of the capacity for the Gaussian case are given. A key element in the converse proofs of is that one of the encoders, referred to as the uninformed encoder, sends inputs which are function of only the message to transmit.

  • Format: PDF
  • Size: 133.57 KB