activity
20092012
most citedMultiple-access Network Information-flow and Correction Codes

20 citations · 37 across the 6 of their papers we have counts for

collaborators
Showing cs.ITShow all

5 papers · 1 filter

cs.IT2012

Network Equivalence in the Presence of an Eavesdropper

Theodoros K. Dikaliotis, Hongyi Yao, Tracey Ho +2

We consider networks of noisy degraded wiretap channels in the presence of an eavesdropper. For the case where the eavesdropper can wiretap at most one channel at a time, we show t…

cs.IT2012

On the Delay Advantage of Coding in Packet Erasure Networks

Theodoros K. Dikaliotis, Alexandros G. Dimakis, Tracey Ho +1

We consider the delay of network coding compared to routing with retransmissions in packet erasure networks with probabilistic erasures. We investigate the sub-linear term in the b…

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.IT2010★ 20 cited

Multiple-access Network Information-flow and Correction Codes

Theodoros K. Dikaliotis, Tracey Ho, Sidharth Jaggi +5

This work considers the multiple-access multicast error-correction scenario over a packetized network with malicious edge adversaries. The network has min-cut and packets o…

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…