Approximate Capacity of a Class of Gaussian Interference-Relay Networks
From MaRDI portal
(Redirected from Publication:5280932)
Recommendations
- Capacity Approximations for Gaussian Relay Networks
- Capacity Bounds for a Class of Interference Relay Channels
- On the Capacity of Large Gaussian Relay Networks
- The Approximate Capacity of the Gaussian N-Relay Diamond Network
- Capacity Bounds for the Gaussian Interference Channel
- Capacity Bounds for Relay Channels With Intersymbol Interference and Colored Gaussian Noise
- The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels
- Capacity Theorems for the Fading Interference Channel With a Relay and Feedback Links
- Capacity of a Class of Deterministic Relay Channels
- Capacity Bounds for the K -User Gaussian Interference Channel
Cited in
(5)- The Approximate Capacity of the Gaussian N-Relay Diamond Network
- Coarse Network Coding: A Simple Relay Strategy for Two-User Gaussian Interference Channels
- Symmetric Capacity of the Gaussian Interference Channel With an Out-of-Band Relay to Within 1.15 Bits
- Ergodic Channel Capacity of an Amplify-and-Forward Relay System at Low SNR in a Generic Noise Environment
- Approximately Achieving Gaussian Relay Network Capacity With Lattice-Based QMF Codes
This page was built for publication: Approximate Capacity of a Class of Gaussian Interference-Relay Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280932)