A General Achievable Rate Region for Multiple-Access Relay Channels and Some Certain Capacity Theorems

Details A General Achievable Rate Region for Multiple-Access Relay Channels and Some Certain Capacity Theorems A General Achievable Rate Region for Multiple-Access Relay Channels and Some Certain Capacity Theorems

2011-08-16

arxiv.org/abs/1108.3365v1

Computer Science

Information Theory

5 pages, 1 figure

Scientific paper

In this paper, we obtain a general achievable rate region and some certain capacity theorems for multiple-access relay channel (MARC), using decode and forward (DAF) strategy at the relay, superposition coding at the transmitters. Our general rate region (i) generalizes the achievability part of Slepian-Wolf multiple-access capacity theorem to the MARC, (ii) extends the Cover-El Gamal best achievable rate for the relay channel with DAF strategy to the MARC, (iii) gives the Kramer-Wijengaarden rate region for the MARC, (iv) meets max-flow min-cut upper bound and leads to the capacity regions of some important classes of the MARC.

Affiliated with

Also associated with

No associations

Rating

A General Achievable Rate Region for Multiple-Access Relay Channels and Some Certain Capacity Theorems 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 General Achievable Rate Region for Multiple-Access Relay Channels and Some Certain Capacity Theorems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A General Achievable Rate Region for Multiple-Access Relay Channels and Some Certain Capacity Theorems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-539583