Low-Complexity Near-Optimal Codes for Gaussian Relay Networks
Information Theory
2011-02-28 v1 Networking and Internet Architecture
math.IT
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.
Cite
@article{arxiv.1102.5138,
title = {Low-Complexity Near-Optimal Codes for Gaussian Relay Networks},
author = {Theodoros K. Dikaliotis and Hongyi Yao and Salman Avestimehr and Sidharth Jaggi and Tracey Ho},
journal= {arXiv preprint arXiv:1102.5138},
year = {2011}
}