Correction of adversarial errors in networks

Sidharth Jaggi, Michael Langbergt, Tracey Ho, Michelle Effros

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


We design codes to transmit information over a network, some subset of which is controlled by a malicious adversary. The computationally unbounded, hidden adversary knows the message to be transmitted, and can observe and change information over the part of the network he controls. The network nodes do not share resources such as shared randomness or a private key. We first consider a unicast problem in a network with |ε| parallel, unit-capacity, directed edges. The rate-region has two parts. If the adversary controls a fraction p < 0.5 of the |ε| edges, the maximal throughput equals (1 -p)|ε|. We describe low-complexity codes that achieve this rate-region. We then extend these results to investigate more general multicast problems in directed, acyclic networks.

Original languageEnglish
Title of host publicationProceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05
Number of pages5
StatePublished - 2005
Externally publishedYes
Event2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia
Duration: 4 Sep 20059 Sep 2005

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8099


Conference2005 IEEE International Symposium on Information Theory, ISIT 05


Dive into the research topics of 'Correction of adversarial errors in networks'. Together they form a unique fingerprint.

Cite this