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 | IEEE International Symposium on Information Theory - Proceedings |
| Pages | 2423-2427 |
| Number of pages | 5 |
| DOIs | |
| 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 |
Other
| Other | 2010 IEEE International Symposium on Information Theory, ISIT 2010 |
|---|---|
| Country | United States |
| City | Austin, TX |
| Period | 6/13/10 → 6/18/10 |
Fingerprint
Keywords
- Byzantine attack
- Network coding
- Network error correction
- Nonlinear codes
ASJC Scopus subject areas
- Applied Mathematics
- Modeling and Simulation
- Theoretical Computer Science
- Information Systems
Cite this
Polytope codes against adversaries in networks. / Kosut, Oliver; Tong, Lang; Tse, David.
IEEE International Symposium on Information Theory - Proceedings. 2010. p. 2423-2427 5513777.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
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
SN - 9781424469604
SP - 2423
EP - 2427
BT - IEEE International Symposium on Information Theory - Proceedings
ER -