Skip to main navigation Skip to search Skip to main content

Coding against delayed adversaries

  • Indian Institute of Technology Bombay
  • Chinese University of Hong Kong
  • University of California at San Diego

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

20 Scopus citations

Abstract

In this work we consider the communication of information in the presence of a delayed adversarial jammer. In the setting under study, a sender wishes to communicate a message to a receiver by transmitting a codeword x = (x 1,⋯, xn) over a communication channel. The adversarial jammer can view the transmitted symbols xi one at a time, but must base its action (when changing xi) on xj for j≤i-Δn, where Δ ∈ [0,1] is a delay parameter. In this work, "we study codes for a class of delayed adversaries, and for any delay Δ > 0 present a single letter characterization of the achievable communication rate in the presence of such adversaries.

Original languageEnglish
Title of host publication2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
Pages285-289
Number of pages5
DOIs
StatePublished - 2010
Event2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States
Duration: Jun 13 2010Jun 18 2010

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8103

Conference

Conference2010 IEEE International Symposium on Information Theory, ISIT 2010
Country/TerritoryUnited States
CityAustin, TX
Period06/13/1006/18/10

Fingerprint

Dive into the research topics of 'Coding against delayed adversaries'. Together they form a unique fingerprint.

Cite this