Capacity of a Class of Modulo-Sum Relay Channels

Details Capacity of a Class of Modulo-Sum Relay Channels Capacity of a Class of Modulo-Sum Relay Channels

2007-04-26

arxiv.org/abs/0704.3591v1

Computer Science

Information Theory

To be presented in IEEE Int. Symp. on Inform. Theory (ISIT) 2007

Scientific paper

This paper characterizes the capacity of a class of modulo additive noise relay channels, in which the relay observes a corrupted version of the noise and has a separate channel to the destination. The capacity is shown to be strictly below the cut-set bound in general and achievable using a quantize-and-forward strategy at the relay. This result confirms a conjecture by Ahlswede and Han about the capacity of channels with rate limited state information at the destination for this particular class of channels.

Affiliated with

Also associated with

No associations

Rating

Capacity of a Class of Modulo-Sum Relay Channels 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 Capacity of a Class of Modulo-Sum Relay Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Capacity of a Class of Modulo-Sum Relay Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-373462