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

被引:0
|
作者
Dey, Bikash Kumar [1 ]
Jaggi, Sidharth [2 ]
Langb, Michael [3 ]
Sarwate, Anand D. [4 ]
Zhang, Yihan [5 ]
机构
[1] Indian Inst Technol, Bombay, India
[2] Univ Bristol, Bristol, England
[3] SUNY Buffalo, Buffalo, NY USA
[4] Rutgers State Univ, New Brunswick, NJ USA
[5] IST Austria, Klosterneuburg, Austria
基金
美国国家科学基金会;
关键词
ARBITRARILY VARYING CHANNEL; SUFFICIENTLY MYOPIC ADVERSARIES; EXPONENTIAL ERROR-BOUNDS; PROBABILITY FUNCTIONS; CAPACITY THEOREMS; BINARY CHANNELS; CODING SCHEME; REED-SOLOMON; INFORMATION; COMMUNICATION;
D O I
10.1561/0100000112
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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.
引用
收藏
页码:300 / 588
页数:293
相关论文
共 50 条
  • [21] Improved cryptographic hash functions with worst-case/average-case connection
    Micciancio, D
    17TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2002, : 9 - 9
  • [22] Concrete Security from Worst-Case to Average-Case Lattice Reductions
    Gartner, Joel
    PROGRESS IN CRYPTOLOGY - AFRICACRYPT 2023, 2023, 14064 : 344 - 369
  • [23] Relativized Worlds without Worst-Case to Average-Case Reductions for NP
    Watson, Thomas
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2010, 6302 : 752 - 765
  • [24] Quantum Worst-Case to Average-Case Reductions for All Linear Problems
    Asadi, Vahid R.
    Golovnev, Alexander
    Gur, Tom
    Shinkar, Igor
    Subramanian, Sathyawageeswar
    PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 2535 - 2567
  • [25] Worst-case and average-case approximations by simple randomized search heuristics
    Witt, C
    STACS 2005, PROCEEDINGS, 2005, 3404 : 44 - 56
  • [26] A New View on Worst-Case to Average-Case Reductions for NP Problems
    Holenstein, Thomas
    Kuenzler, Robin
    COMPUTING AND COMBINATORICS, COCOON 2014, 2014, 8591 : 203 - 214
  • [27] Average-Case Hardness of NP from Exponential Worst-Case Hardness Assumptions
    Hirahara, Shuichi
    STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2021, : 292 - 302
  • [28] An improved worst-case to average-case connection for lattice problems (extended abstract)
    Cai, JY
    Nerurkar, AP
    38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1997, : 468 - 477
  • [29] Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses
    Gu, Xiaoyang
    Hitchcock, John M.
    Pavan, A.
    THEORY OF COMPUTING SYSTEMS, 2012, 51 (02) : 248 - 265
  • [30] COLLAPSING AND SEPARATING COMPLETENESS NOTIONS UNDER AVERAGE-CASE AND WORST-CASE HYPOTHESES
    Gu, Xiaoyang
    Hitchcock, John M.
    Pavan, A.
    27TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2010), 2010, 5 : 429 - 440