The State-Dependent Multiple-Access Channel with States Available at a Cribbing Encoder

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

This is a longer version of a submission to the 2010 IEEE 26-th Convention of Electrical and Electronics Engineers in Israel (

Scientific paper

The two-user discrete memoryless state-dependent multiple-access channel (MAC) models a scenario in which two encoders transmit independent messages to a single receiver via a MAC whose channel law is governed by the pair of encoders' inputs and by an i.i.d. state random variable. In the cooperative state-dependent MAC model it is further assumed that Message 1 is shared by both encoders whereas Message 2 is known only to Encoder 2 - the cognitive transmitter. The capacity of the cooperative state-dependent MAC where the realization of the state sequence is known non-causally to the cognitive encoder has been derived by Somekh-Baruch et. al. In this work we dispense of the assumption that Message 1 is shared a-priori by both encoders. Instead, we study the case in which Encoder 2 cribs causally from Encoder 1. We determine the capacity region for both, the case where Encoder 2 cribs strictly causal and the case where Encoder 2 cribs causally from Encoder 1.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The State-Dependent Multiple-Access Channel with States Available at a Cribbing Encoder 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 The State-Dependent Multiple-Access Channel with States Available at a Cribbing Encoder, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The State-Dependent Multiple-Access Channel with States Available at a Cribbing Encoder will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-612668

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.