תקציר
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/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.
| שפה מקורית | אנגלית |
|---|---|
| עמודים (מ-עד) | 300-588 |
| מספר עמודים | 289 |
| כתב עת | Foundations and Trends in Communications and Information Theory |
| כרך | 21 |
| מספר גיליון | 3-4 |
| מזהי עצם דיגיטלי (DOIs) | |
| סטטוס פרסום | פורסם - 3 דצמ׳ 2024 |
| פורסם באופן חיצוני | כן |
הערה ביבליוגרפית
Publisher Copyright:©2024 B. K. Dey et al.
טביעת אצבע
להלן מוצגים תחומי המחקר של הפרסום 'Codes for Adversaries: Between Worst-Case and Average-Case Jamming'. יחד הם יוצרים טביעת אצבע ייחודית.פורמט ציטוט ביבליוגרפי
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver