%0 Journal Article
%T Low-Complexity Near-Optimal Codes for Gaussian Relay Networks
%A Theodoros K. Dikaliotis
%A Hongyi Yao
%A Salman Avestimehr
%A Sidharth Jaggi
%A Tracey Ho
%J Mathematics
%D 2011
%I arXiv
%X 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.
%U http://arxiv.org/abs/1102.5138v1