Coding against delayed adversaries

Bikash Kumar Dey; Sidharth Jaggi; Michael Langberg; Anand D. Sarwate

doi:10.1109/ISIT.2010.5513325

Coding against delayed adversaries

Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate

Computer Science discipline

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 ₁,⋯, x_n) over a communication channel. The adversarial jammer can view the transmitted symbols x_i one at a time, but must base its action (when changing x_i) on x_j 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 language	English
Title of host publication	2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
Pages	285-289
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2010.5513325
State	Published - 2010
Event	2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States Duration: 13 Jun 2010 → 18 Jun 2010

Publication series

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

Conference

Conference	2010 IEEE International Symposium on Information Theory, ISIT 2010
Country/Territory	United States
City	Austin, TX
Period	13/06/10 → 18/06/10

Access to Document

10.1109/ISIT.2010.5513325

Cite this

@inproceedings{544e2a5c76604f719f0d4682ae6d985f,

title = "Coding against delayed adversaries",

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.",

author = "Dey, {Bikash Kumar} and Sidharth Jaggi and Michael Langberg and Sarwate, {Anand D.}",

year = "2010",

doi = "10.1109/ISIT.2010.5513325",

language = "אנגלית",

isbn = "9781424469604",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "285--289",

booktitle = "2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings",

}

Dey, BK, Jaggi, S, Langberg, M & Sarwate, AD 2010, Coding against delayed adversaries. in 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings., 5513325, IEEE International Symposium on Information Theory - Proceedings, pp. 285-289, 2010 IEEE International Symposium on Information Theory, ISIT 2010, Austin, TX, United States, 13/06/10. https://doi.org/10.1109/ISIT.2010.5513325

Coding against delayed adversaries. / Dey, Bikash Kumar; Jaggi, Sidharth; Langberg, Michael et al.
2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings. 2010. p. 285-289 5513325 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Coding against delayed adversaries

AU - Dey, Bikash Kumar

AU - Jaggi, Sidharth

AU - Langberg, Michael

AU - Sarwate, Anand D.

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

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

U2 - 10.1109/ISIT.2010.5513325

DO - 10.1109/ISIT.2010.5513325

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:77955669308

SN - 9781424469604

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 285

EP - 289

BT - 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings

T2 - 2010 IEEE International Symposium on Information Theory, ISIT 2010

Y2 - 13 June 2010 through 18 June 2010

ER -

Coding against delayed adversaries

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this