Low-Complexity Near-Optimal Codes for Gaussian Relay Networks
arXiv:1102.5138
Abstract
We consider the problem of information flow over Gaussian relay networks. Similar to the recent work by Avestimehr \emph{et al.} [1], we propose network codes that achieve up to a constant gap from the capacity of such networks. However, our proposed codes are also computationally tractable. Our main technique is to use the codes of Avestimehr \emph{et al.} as inner codes in a concatenated coding scheme.
References in corpus (4)
- Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels
- Wireless Network Information Flow: A Deterministic Approach
- Nested Lattice Codes for Gaussian Relay Networks with Interference
- Toward Fast Reliable Communication at Rates Near Capacity with Gaussian Noise