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. It is also shown that this cut-set bound is not always tight, and a tighter bound is given for an example network.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2010
Accession Number
ADA557820

Entities

People

  • David Tse
  • Lang Tong
  • Oliver Kosut

Organizations

  • Cornell University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Abstracts
  • Coding
  • Decoding
  • Information Operations
  • Military Research
  • Networks
  • Probability
  • Probability Distributions
  • Random Variables
  • Sequences
  • Standards
  • Symbols
  • Throughput
  • Transmission Lines
  • Universities
  • Wireless Networks

Fields of Study

  • Computer science

Readers

  • Computer Programming and Software Development.
  • Graph Algorithms and Convex Optimization.