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

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

2010-12-09

arxiv.org/abs/1012.1912v1

Computer Science

Information Theory

8 pages, 1 figure, accepted for publication, in press

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the Capacity of Memoryless Finite-State Multiple-Access Channels with Asymmetric State Information at the Encoders does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Capacity of Memoryless Finite-State Multiple-Access Channels with Asymmetric State Information at the Encoders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Capacity of Memoryless Finite-State Multiple-Access Channels with Asymmetric State Information at the Encoders will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-76463