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

被引：0
|
作者：
Dey, Bikash Kumar [1 ]
Jaggi, Sidharth [2 ]
Langberg, Michael [3 ]
Sarwate, Anand D. [4 ]
Zhang, Yihan [5 ]
机构：
[1] Indian Institute of Technology Bombay, India
[2] University of Bristol, United Kingdom
[3] University at Buffalo, United States
[4] Rutgers University, United States
[5] Institute of Science and Technology Austria, Austria
来源：
Foundations and Trends in Communications and Information Theory | 2024年 / 21卷 / 3-4期
关键词：
181;
D O I：
10.1561/0100000112
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：300 / 588
相关论文
共 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, N. V.
    THEORY OF COMPUTING SYSTEMS, 2008, 42 (04) : 596 - 607
  • [3] Relations between average-case and worst-case complexity
    Pavan, A
    Vinodchandran, NV
    FUNDAMENTALS OF COMPUTATIONAL THEORY, PROCEEDINGS, 2005, 3623 : 422 - 432
  • [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] On worst-case to average-case reductions for NP problems
    Bogdanov, Andrej
    Trevisan, Luca
    SIAM JOURNAL ON COMPUTING, 2006, 36 (04) : 1119 - 1159
  • [6] Worst-case to average-case reductions for module lattices
    Langlois, Adeline
    Stehle, Damien
    DESIGNS CODES AND CRYPTOGRAPHY, 2015, 75 (03) : 565 - 599
  • [7] Worst-case to average-case reductions for module lattices
    Adeline Langlois
    Damien Stehlé
    Designs, Codes and Cryptography, 2015, 75 : 565 - 599
  • [8] 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
  • [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
12345