Coding against myopic adversaries

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

9 Citations (Scopus)

Abstract

A variant on the arbitrarily varying channel (AVC) is proposed in which the jammer is allowed to base its actions on a noisy version of the transmitted codeword. It is shown via a random coding argument that the capacity is the minimum over all discrete memoryless channels (DMCs) that can be induced by memoryless strategies of the adversary. This generalizes two existing models in the AVC literature: the standard AVC in which the jammer does not know the channel input, and the AVC in which the jammer knows the channel input exactly.

Original languageEnglish (US)
Title of host publication2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings
DOIs
StatePublished - Dec 1 2010
Event2010 IEEE Information Theory Workshop, ITW 2010 - Dublin, Ireland
Duration: Aug 30 2010Sep 3 2010

Publication series

Name2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings

Other

Other2010 IEEE Information Theory Workshop, ITW 2010
CountryIreland
CityDublin
Period8/30/109/3/10

Fingerprint

Coding
Generalise
Model
Standards
Strategy

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Applied Mathematics

Cite this

Sarwate, A. D. (2010). Coding against myopic adversaries. In 2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings [5592896] (2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings). https://doi.org/10.1109/CIG.2010.5592896
Sarwate, Anand D. / Coding against myopic adversaries. 2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings. 2010. (2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings).
@inproceedings{c8be91ddb82e4d22b3c899cd8f9f4454,
title = "Coding against myopic adversaries",
abstract = "A variant on the arbitrarily varying channel (AVC) is proposed in which the jammer is allowed to base its actions on a noisy version of the transmitted codeword. It is shown via a random coding argument that the capacity is the minimum over all discrete memoryless channels (DMCs) that can be induced by memoryless strategies of the adversary. This generalizes two existing models in the AVC literature: the standard AVC in which the jammer does not know the channel input, and the AVC in which the jammer knows the channel input exactly.",
author = "Sarwate, {Anand D.}",
year = "2010",
month = "12",
day = "1",
doi = "10.1109/CIG.2010.5592896",
language = "English (US)",
isbn = "9781424482641",
series = "2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings",
booktitle = "2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings",

}

Sarwate, AD 2010, Coding against myopic adversaries. in 2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings., 5592896, 2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings, 2010 IEEE Information Theory Workshop, ITW 2010, Dublin, Ireland, 8/30/10. https://doi.org/10.1109/CIG.2010.5592896

Coding against myopic adversaries. / Sarwate, Anand D.

2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings. 2010. 5592896 (2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings).

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

TY - GEN

T1 - Coding against myopic adversaries

AU - Sarwate, Anand D.

PY - 2010/12/1

Y1 - 2010/12/1

N2 - A variant on the arbitrarily varying channel (AVC) is proposed in which the jammer is allowed to base its actions on a noisy version of the transmitted codeword. It is shown via a random coding argument that the capacity is the minimum over all discrete memoryless channels (DMCs) that can be induced by memoryless strategies of the adversary. This generalizes two existing models in the AVC literature: the standard AVC in which the jammer does not know the channel input, and the AVC in which the jammer knows the channel input exactly.

AB - A variant on the arbitrarily varying channel (AVC) is proposed in which the jammer is allowed to base its actions on a noisy version of the transmitted codeword. It is shown via a random coding argument that the capacity is the minimum over all discrete memoryless channels (DMCs) that can be induced by memoryless strategies of the adversary. This generalizes two existing models in the AVC literature: the standard AVC in which the jammer does not know the channel input, and the AVC in which the jammer knows the channel input exactly.

UR - http://www.scopus.com/inward/record.url?scp=80051945299&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80051945299&partnerID=8YFLogxK

U2 - 10.1109/CIG.2010.5592896

DO - 10.1109/CIG.2010.5592896

M3 - Conference contribution

AN - SCOPUS:80051945299

SN - 9781424482641

T3 - 2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings

BT - 2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings

ER -

Sarwate AD. Coding against myopic adversaries. In 2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings. 2010. 5592896. (2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings). https://doi.org/10.1109/CIG.2010.5592896