Polytope codes against adversaries in networks

Oliver Kosut, Lang Tong, David N C Tse

Research output: Contribution to journalArticlepeer-review

24 Scopus citations


This paper investigates a network coding problem wherein an adversary controls a subset of nodes in the network of limited quantity but unknown location. This problem is shown to be more difficult than that of an adversary controlling a given number of edges in the network, in that linear codes are insufficient. To solve the node problem, the class of polytope codes is introduced. Polytope codes are constant composition codes operating over bounded polytopes in integer vector fields. The polytope structure creates additional complexity, but it induces properties on marginal distributions of code vectors so that validities of codewords can be checked by internal nodes of the network. It is shown that polytope codes achieve a cut-set bound for a class of planar networks. It is also shown that this cut-set bound is not always tight, and a tighter bound is given for an example network.

Original languageEnglish (US)
Article number6781646
Pages (from-to)3308-3344
Number of pages37
JournalIEEE Transactions on Information Theory
Issue number6
StatePublished - Jun 2014


  • Active adversaries
  • Byzantine attack
  • network coding
  • network error correction
  • nonlinear codes
  • polytope codes
  • security

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'Polytope codes against adversaries in networks'. Together they form a unique fingerprint.

Cite this