@inproceedings{2caee556387540e5b85036977bcb65dc,
title = "Polytope codes against adversaries in networks",
abstract = "Network coding is studied when an unknown subset of nodes in the network is controlled by an adversary. To solve this problem, a new class of codes called Polytope Codes is introduced. Polytope Codes are linear codes operating over bounded polytopes in real 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 a cut-set bound for a class planar networks can be achieved using Polytope Codes. It is also shown that this cut-set bound is not always tight, and a tighter bound is given for an example network.",
keywords = "Byzantine attack, Network coding, Network error correction, Nonlinear codes",
author = "Oliver Kosut and Lang Tong and David Tse",
year = "2010",
doi = "10.1109/ISIT.2010.5513777",
language = "English (US)",
isbn = "9781424469604",
series = "IEEE International Symposium on Information Theory - Proceedings",
pages = "2423--2427",
booktitle = "2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings",
note = "2010 IEEE International Symposium on Information Theory, ISIT 2010 ; Conference date: 13-06-2010 Through 18-06-2010",
}