Polytope codes against adversaries in networks

Oliver Kosut; Lang Tong; David Tse

doi:10.1109/ISIT.2010.5513777

Polytope codes against adversaries in networks

Oliver Kosut, Lang Tong, David Tse

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

16 Scopus citations

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.

Original language	English (US)
Title of host publication	2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
Pages	2423-2427
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2010.5513777
State	Published - 2010
Externally published	Yes
Event	2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States Duration: Jun 13 2010 → Jun 18 2010

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8103

Other

Other	2010 IEEE International Symposium on Information Theory, ISIT 2010
Country/Territory	United States
City	Austin, TX
Period	6/13/10 → 6/18/10

Keywords

Byzantine attack
Network coding
Network error correction
Nonlinear codes

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2010.5513777

Cite this

Kosut, O, Tong, L & Tse, D 2010, Polytope codes against adversaries in networks. in 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings., 5513777, IEEE International Symposium on Information Theory - Proceedings, pp. 2423-2427, 2010 IEEE International Symposium on Information Theory, ISIT 2010, Austin, TX, United States, 6/13/10. https://doi.org/10.1109/ISIT.2010.5513777

@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",

}

TY - GEN

T1 - Polytope codes against adversaries in networks

AU - Kosut, Oliver

AU - Tong, Lang

AU - Tse, David

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

KW - Byzantine attack

KW - Network coding

KW - Network error correction

KW - Nonlinear codes

UR - http://www.scopus.com/inward/record.url?scp=77955684457&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955684457&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2010.5513777

DO - 10.1109/ISIT.2010.5513777

M3 - Conference contribution

AN - SCOPUS:77955684457

SN - 9781424469604

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2423

EP - 2427

BT - 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings

T2 - 2010 IEEE International Symposium on Information Theory, ISIT 2010

Y2 - 13 June 2010 through 18 June 2010

ER -

Polytope codes against adversaries in networks

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this