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 条
  • [41] Average-Case Verification of the Quantum Fourier Transform Enables Worst-Case Phase Estimation
    Linden, Noah
    de Wolf, Ronald
    QUANTUM, 2022, 6
  • [42] NON-BLACK-BOX WORST-CASE TO AVERAGE-CASE REDUCTIONS WITHIN NP
    Hirahara, Shuichi
    SIAM JOURNAL ON COMPUTING, 2023, 52 (06) : 349 - 382
  • [43] Ad-hoc and sensor networks: Worst-case vs. average-case
    Wattenhofer, R
    2004 INTERNATIONAL ZURICH SEMINAR ON COMMUNICATIONS: ACCESS-TRANSMISSION-NETWORKING, PROCEEDINGS, 2004, : 156 - 159
  • [44] WORST-CASE VERSUS AVERAGE-CASE DESIGN FOR ESTIMATION FROM PARTIAL PAIRWISE COMPARISONS
    Pananjady, Ashwin
    Mao, Cheng
    Muthukumar, Vidya
    Wainwright, Martin J.
    Courtade, Thomas A.
    ANNALS OF STATISTICS, 2020, 48 (02): : 1072 - 1097
  • [45] A Combined Average-Case and Worst-Case Analysis for an Integrated Hub Location and Revenue Management Problem
    Huo, Jia-Zhen
    Hou, Yan-Ting
    Chu, Feng
    He, Jun-Kai
    DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2019, 2019
  • [46] Worst-case vs. algorithmic average-case complexity in the polynomial-time hierarchy
    Gutfreund, Dan
    APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2006, 4110 : 386 - 397
  • [47] Beyond the worst-case analysis of random priority: Smoothed and average-case approximation ratios in mechanism design
    Deng, Xiaotie
    Gao, Yansong
    Zhang, Jie
    INFORMATION AND COMPUTATION, 2022, 285
  • [48] Worst-case and average-case analysis of n-detection test sets and test generation strategies
    Pomeranz, I.
    Reddy, S. M.
    IET COMPUTERS AND DIGITAL TECHNIQUES, 2007, 1 (04): : 353 - 363
  • [49] Counting t-Cliques: Worst-Case to Average-Case Reductions and Direct Interactive Proof Systems
    Goldreich, Oded
    Rothblum, Guy N.
    2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2018, : 77 - 88
  • [50] Worst-Case Jamming on MIMO Gaussian Channels
    Gao, Jie
    Vorobyov, Sergiy A.
    Jiang, Hai
    Poor, H. Vincent
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2015, 63 (21) : 5821 - 5836