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 条
  • [31] Special Issue On Worst-case Versus Average-case Complexity Editors’ Foreword
    Oded Goldreich
    Salil Vadhan
    computational complexity, 2007, 16 : 325 - 330
  • [32] Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity
    Hirahara, Shuichi
    2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 50 - 60
  • [33] Special issue on worst-case versus average-case complexity - Editors' foreword
    Goldreich, Oded
    Vadhan, Salil
    COMPUTATIONAL COMPLEXITY, 2007, 16 (04) : 325 - 330
  • [34] Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses
    Xiaoyang Gu
    John M. Hitchcock
    A. Pavan
    Theory of Computing Systems, 2012, 51 : 248 - 265
  • [35] Worst-case and average-case analysis of n-detection test sets
    Pomeranz, I
    Reddy, SM
    DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION, VOLS 1 AND 2, PROCEEDINGS, 2005, : 444 - 449
  • [36] On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis
    Simroth, Axel
    Souza, Alexander
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2009, 5609 : 168 - +
  • [37] On Online Algorithms for Bin, Strip, and Box Packing, and Their Worst-Case and Average-Case Analysis
    D. O. Lazarev
    N. N. Kuzyurin
    Programming and Computer Software, 2019, 45 : 448 - 457
  • [38] Non-black-box Worst-case to Average-case Reductions within NP
    Hirahara, Shuichi
    2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2018, : 247 - 258
  • [39] On Online Algorithms for Bin, Strip, and Box Packing, and Their Worst-Case and Average-Case Analysis
    Lazarev, D. O.
    Kuzyurin, N. N.
    PROGRAMMING AND COMPUTER SOFTWARE, 2019, 45 (08) : 448 - 457
  • [40] Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems
    Gama, Nicolas
    Izabachene, Malika
    Nguyen, Phong Q.
    Xie, Xiang
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2016, PT II, 2016, 9666 : 528 - 558