Capacity of a Class of Modulo-Sum Relay Channels

2007/04/26 by Marko Aleksic, Aleksic, Marko, Peyman Razaghi +3
Computer Science · Engineering · Mathematics · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Full-Duplex Wireless Communications #Information Theory (cs.IT) #Wireless Communication Security Techniques #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.0704.3591

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

arxiv created 2007/04/26 · openalex publication_date 2007/04/26 · arxiv updated 2016/09/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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.

Related

• A New Upper Bound on the Capacity of a Class of Primitive Relay Channels
• Capacity of the Gaussian Relay Channel with Correlated Noises to Within a Constant Gap
• Capacity of a Class of State-Dependent Orthogonal Relay Channels
• Bounds on the Capacity of the Relay Channel with States at the Source
• A Strengthened Cutset Upper Bound on the Capacity of the Relay Channel and Applications