30 citations · 72 across the 25 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.IT2013
Routing for Security in Networks with Adversarial Nodes
Pak Hou Che, Minghua Chen, Tracey Ho +2
We consider the problem of secure unicast transmission between two nodes in a directed graph, where an adversary eavesdrops/jams a subset of nodes. This adversarial setting is in c…
cs.IT2013★ 17 cited
Local Graph Coloring and Index Coding
Karthikeyan Shanmugam, Alexandros G. Dimakis, Michael Langberg
We present a novel upper bound for the optimal index coding rate. Our bound uses a graph theoretic quantity called the local chromatic number. We show how a good local coloring can…