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 条
  • [1] Relations between Average-Case and Worst-Case Complexity
    A. Pavan
    N. V. Vinodchandran
    Theory of Computing Systems, 2008, 42 : 596 - 607
  • [2] Relations between average-case and worst-case complexity
    Pavan, A
    Vinodchandran, NV
    FUNDAMENTALS OF COMPUTATIONAL THEORY, PROCEEDINGS, 2005, 3623 : 422 - 432
  • [3] Relations between average-case and worst-case complexity
    Pavan, A.
    Vinodchandran, N. V.
    THEORY OF COMPUTING SYSTEMS, 2008, 42 (04) : 596 - 607
  • [4] Worst-case to average-case reductions revisited
    Gutfreund, Dan
    Ta-Shma, Amnon
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2007, 4627 : 569 - +
  • [5] Worst-case to average-case reductions for module lattices
    Langlois, Adeline
    Stehle, Damien
    DESIGNS CODES AND CRYPTOGRAPHY, 2015, 75 (03) : 565 - 599
  • [6] Worst-case to average-case reductions for module lattices
    Adeline Langlois
    Damien Stehlé
    Designs, Codes and Cryptography, 2015, 75 : 565 - 599
  • [7] On worst-case to average-case reductions for NP problems
    Bogdanov, A
    Trevisan, L
    44TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2003, : 308 - 317
  • [8] On worst-case to average-case reductions for NP problems
    Bogdanov, Andrej
    Trevisan, Luca
    SIAM JOURNAL ON COMPUTING, 2006, 36 (04) : 1119 - 1159
  • [9] Worst-Case Running Times for Average-Case Algorithms
    Antunes, Luis
    Fortnow, Lance
    PROCEEDINGS OF THE 24TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, 2009, : 298 - +
  • [10] Minimizing worst-case and average-case makespan over scenarios
    Esteban Feuerstein
    Alberto Marchetti-Spaccamela
    Frans Schalekamp
    René Sitters
    Suzanne van der Ster
    Leen Stougie
    Anke van Zuylen
    Journal of Scheduling, 2017, 20 : 545 - 555