Polytope Codes Against Adversaries in Networks

Details Polytope Codes Against Adversaries in Networks Polytope Codes Against Adversaries in Networks

2011-12-14

arxiv.org/abs/1112.3307v1

Computer Science

Information Theory

63 pages. Submitted to IEEE Transactions on Information Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Polytope Codes Against Adversaries in Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Polytope Codes Against Adversaries in Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polytope Codes Against Adversaries in Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-228198