Nonlinear network coding is necessary to combat General Byzantine attacks

Oliver Kosut, Lang Tong, David Tse

Research output: Chapter in Book/Report/Conference proceedingConference contribution

41 Scopus citations

Abstract

We consider the problem of achieving capacity through network coding when some of the nodes act covertly as Byzantine adversaries. For several case-study networks, we investigate rates of reliable communication through network coding and upper bounds on capacity. We show that linear codes are inadequate in general, and a slight augmentation of the class of linear codes can increase throughput. Furthermore, we show that even this nonlinear augmentation may not be enough to achieve capacity. We introduce a new class of codes known as bounded-linear that make use of distributions defined over bounded sets of integers subject to linear constraints using real arithmetic.

Original languageEnglish (US)
Title of host publication2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
Pages593-599
Number of pages7
DOIs
StatePublished - 2009
Externally publishedYes
Event2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009 - Monticello, IL, United States
Duration: Sep 30 2009Oct 2 2009

Publication series

Name2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Other

Other2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
CountryUnited States
CityMonticello, IL
Period9/30/0910/2/09

ASJC Scopus subject areas

  • Computer Science(all)
  • Control and Systems Engineering
  • Communication

Fingerprint Dive into the research topics of 'Nonlinear network coding is necessary to combat General Byzantine attacks'. Together they form a unique fingerprint.

Cite this