6 citations · 8 across the 2 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2011★ 2 cited
Low-Complexity Near-Optimal Codes for Gaussian Relay Networks
Theodoros K. Dikaliotis, Hongyi Yao, Salman Avestimehr +2
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…
cs.IT2009★ 6 cited
On the Delay of Network Coding over Line Networks
Theodoros K. Dikaliotis, Alexandros G. Dimakis, Tracey Ho +1
We analyze a simple network where a source and a receiver are connected by a line of erasure channels of different reliabilities. Recent prior work has shown that random linear net…