Achieving Net Feedback Gain in the Linear-Deterministic Butterfly Network with a Full-Duplex Relay

DOI10.1007/978-3-642-36899-8_7zbMath1334.94031arXiv1207.6540OpenAlexW1593466980MaRDI QIDQ4915235

Anas Chaaban, Aydin Sezgin, Daniela Tuninetti

Publication date: 9 April 2013

Published in: Information Theory, Combinatorics, and Search Theory (Search for Journal in Brave)

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

zbMATH Keywords

capacitybutterfly networkouter boundinner boundinterference relay channel with feedback

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Communication theory (94A05)

Cites Work

• Network Information Theory
• Capacity theorems for the relay channel
• A new achievable rate region for the interference channel
• Interference channels
• Network information flow
• Relaying in the Presence of Interference: Achievable Rates, Interference Forwarding, and Outer Bounds
• On the Generalized Degrees of Freedom of the Gaussian Interference Relay Channel
• Achievable Rate Regions and Performance Comparison of Half Duplex Bi-Directional Relaying Protocols
• Compute-and-Forward: Harnessing Interference Through Structured Codes
• Joint Physical Layer Coding and Network Coding for Bidirectional Relaying
• Elements of Information Theory

This page was built for publication: Achieving Net Feedback Gain in the Linear-Deterministic Butterfly Network with a Full-Duplex Relay