Polytope Codes Against Adversaries in Networks

DOI10.1109/TIT.2014.2314642zbMATH Open1360.94314arXiv1112.3307MaRDI QIDQ2986330FDOQ2986330

Authors: Oliver Kosut, Lang Tong, David N. C. Tse 

Publication date: 16 May 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: Network coding is studied when 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 when the adversary controls 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.

Full work available at URL: https://arxiv.org/abs/1112.3307

Mathematics Subject Classification ID

Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorial codes (94B25) Network design and communication in computer systems (68M10)

This page was built for publication: Polytope Codes Against Adversaries in Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986330)