A Note on Multiple-Access Channels with Strictly-Causal State Information

Details A Note on Multiple-Access Channels with Strictly-Causal State Information A Note on Multiple-Access Channels with Strictly-Causal State Information

2011-06-02

arxiv.org/abs/1106.0380v1

Computer Science

Information Theory

To appear in the proceedings of Wireless Advanced, London June 20-22, 2011

Scientific paper

We propose a new inner bound on the capacity region of a memoryless multiple-access channel that is governed by a memoryless state that is known strictly causally to the encoders. The new inner bound contains the previous bounds, and we provide an example demonstrating that the inclusion can be strict. A variation on this example is then applied to the case where the channel is governed by two independent state sequences, where each transmitter knows one of the states strictly causally. The example proves that, as conjectured by Li et al., an inner bound that they derived for this scenario can indeed by strictly better than previous bounds.

Affiliated with

Also associated with

No associations

Rating

A Note on Multiple-Access Channels with Strictly-Causal State Information 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 A Note on Multiple-Access Channels with Strictly-Causal State Information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Note on Multiple-Access Channels with Strictly-Causal State Information will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-494967