Capacity of a Class of Modulo-Sum Relay Channels

DOI10.1109/TIT.2008.2011518MaRDI QIDQ4975748zbMATH OpenOpenAlexFDO

Authors Marko Aleksic, Peyman Razaghi, Wei Yu

Publication date 8 August 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0704.3591

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

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.

Cited in

(2)

• Strong converse theorems for multimessage networks with tight cut-set bound
• Capacity bounds and mapping design for binary symmetric relay channels

This page was built for publication: Capacity of a Class of Modulo-Sum Relay Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4975748)