Codes for adversaries: Between worst-case and average-case jamming

Dey BK, Jaggi S, Langberg M, Sarwate AD, Zhang Y. 2024. Codes for adversaries: Between worst-case and average-case jamming. Foundations and Trends in Communications and Information Theory. 21(3–4), 300–588.

Download
No fulltext has been uploaded. References only!

Journal Article | Published | English

Scopus indexed
Author
Dey, Bikash Kumar; Jaggi, Sidharth; Langberg, Michael; Sarwate, Anand D.; Zhang, YihanISTA

Corresponding author has ISTA affiliation

Department
Abstract
Over the last 70 years, information theory and coding has enabled communication technologies that have had an astounding impact on our lives. This is possible due to the match between encoding/decoding strategies and corresponding channel models. Traditional studies of channels have taken one of two extremes: Shannon-theoretic models are inherently average-case in which channel noise is governed by a memoryless stochastic process, whereas coding-theoretic (referred to as “Hamming”) models take a worst-case, adversarial, view of the noise. However, for several existing and emerging communication systems the Shannon/average-case view may be too optimistic, whereas the Hamming/worstcase view may be too pessimistic. This monograph takes up the challenge of studying adversarial channel models that lie between the Shannon and Hamming extremes.
Publishing Year
Date Published
2024-12-03
Journal Title
Foundations and Trends in Communications and Information Theory
Publisher
Now Publishers
Volume
21
Issue
3-4
Page
300-588
ISSN
eISSN
IST-REx-ID

Cite this

Dey BK, Jaggi S, Langberg M, Sarwate AD, Zhang Y. Codes for adversaries: Between worst-case and average-case jamming. Foundations and Trends in Communications and Information Theory. 2024;21(3-4):300-588. doi:10.1561/0100000112
Dey, B. K., Jaggi, S., Langberg, M., Sarwate, A. D., & Zhang, Y. (2024). Codes for adversaries: Between worst-case and average-case jamming. Foundations and Trends in Communications and Information Theory. Now Publishers. https://doi.org/10.1561/0100000112
Dey, Bikash Kumar, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate, and Yihan Zhang. “Codes for Adversaries: Between Worst-Case and Average-Case Jamming.” Foundations and Trends in Communications and Information Theory. Now Publishers, 2024. https://doi.org/10.1561/0100000112.
B. K. Dey, S. Jaggi, M. Langberg, A. D. Sarwate, and Y. Zhang, “Codes for adversaries: Between worst-case and average-case jamming,” Foundations and Trends in Communications and Information Theory, vol. 21, no. 3–4. Now Publishers, pp. 300–588, 2024.
Dey BK, Jaggi S, Langberg M, Sarwate AD, Zhang Y. 2024. Codes for adversaries: Between worst-case and average-case jamming. Foundations and Trends in Communications and Information Theory. 21(3–4), 300–588.
Dey, Bikash Kumar, et al. “Codes for Adversaries: Between Worst-Case and Average-Case Jamming.” Foundations and Trends in Communications and Information Theory, vol. 21, no. 3–4, Now Publishers, 2024, pp. 300–588, doi:10.1561/0100000112.

Export

Marked Publications

Open Data ISTA Research Explorer

Search this title in

Google Scholar