Foundations and Trends® in Communications and Information Theory > Vol 21 > Issue 3-4

Codes for Adversaries: Between Worst-Case and Average-Case Jamming

By Bikash Kumar Dey, IIT Bombay, India, bikash@ee.iitb.ac.in | Sidharth Jaggi, University of Bristol, UK, sid.jaggi@bristol.ac.uk | Michael Langberg, University at Buffalo, USA, mikel@buffalo.edu | Anand D. Sarwate, Rutgers University, USA, anand.sarwate@rutgers.edu | Yihan Zhang, IST Austria, Austria, zephyr.z798@gmail.com

 
Suggested Citation
Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate and Yihan Zhang (2024), "Codes for Adversaries: Between Worst-Case and Average-Case Jamming", Foundations and Trends® in Communications and Information Theory: Vol. 21: No. 3-4, pp 300-588. http://dx.doi.org/10.1561/0100000112

Publication Date: 03 Dec 2024
© 2024 B. K. Dey et al.
 
Subjects
Coding theory and practice,  Information theory and computer science,  Statistical/machine learning,  Discrete mathematics,  Applied mathematics
 

Free Preview:

Download extract

Share

Download article
In this article:
1. Introduction
2. A Unified Channel Model Using AVCs
3. Motivating Example: Large Alphabets
4. Motivating Example: Binary Erasures
5. List-decoding
6. AVCs with Common Randomness
7. Oblivious Adversaries
8. Omniscient Adversaries
9. Myopic Adversaries
10. Causal (Online) Adversaries
11. Additional Topics and Related Problems
Acknowledgements
References

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.

DOI:10.1561/0100000112
ISBN: 978-1-63828-460-4
306 pp. $99.00
Buy book (pb)
 
ISBN: 978-1-63828-461-1
306 pp. $310.00
Buy E-book (.pdf)
Table of contents:
1. Introduction
2. A Unified Channel Model Using AVCs
3. Motivating Example: Large Alphabets
4. Motivating Example: Binary Erasures
5. List-decoding
6. AVCs with Common Randomness
7. Oblivious Adversaries
8. Omniscient Adversaries
9. Myopic Adversaries
10. Causal (Online) Adversaries
11. Additional Topics and Related Problems
Acknowledgements
References

Codes for Adversaries: Between Worst-Case and Average-Case Jamming

Over the last 70 years, information theory and coding have 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/worst-case view may be too pessimistic. This monograph takes up the challenge of studying adversarial channel models that lie between the Shannon and Hamming extremes.

 
CIT-112