Capacity of a Class of Modulo-Sum Relay Channels

DOI10.1109/TIT.2008.2011518zbMath1367.94148arXiv0704.3591OpenAlexW2146818257MaRDI QIDQ4975748

Peyman Razaghi, Wei Yu, Marko Aleksic

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

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

Related Items (2)

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

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