A Constrained Coding Approach to Error-Free Half-Duplex Relay Networks

DOI10.1109/TIT.2013.2269671MaRDI QIDQ5346285zbMATH OpenWikidataFDO

Authors Frank R. Kschischang, Tobias Lutz

Publication date 8 June 2017

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

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

Mathematics Subject Classification ID

Communication theory (94A05) Information theory (general) (94A15) Source coding (94A29) Applications of graph theory to circuits and networks (94C15)

Abstract: We show that the broadcast capacity of an infinite-depth tree-structured network of error-free half-duplex-constrained relays can be achieved using constrained coding at the source and symbol forwarding at the relays.

Cited in

(2)

• Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels
• Compress-Forward Coding With BPSK Modulation for the Half-Duplex Gaussian Relay Channel

This page was built for publication: A Constrained Coding Approach to Error-Free Half-Duplex Relay Networks

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