Query complexity lower bounds for reconstruction of codes

被引：0
|
作者：
Chakraborty, Sourav [1 ]
Fischer, Eldar [2 ]
Matsliah, Arie [3 ]
机构：
[1] Chennai Mathematical Institute, Chennai, India
[2] Faculty of Computer Science, Technion – Israel Institute of Technology, Technion City,Haifa,32000, Israel
[3] Google, Mountain View,CA, United States
来源：
Theory of Computing | 2014年 / 10卷
关键词：
Signal encoding - Decoding;
D O I：
10.4086/toc.2014.v010a019
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：513 / 533
相关论文
共 50 条
  • [1] LOWER BOUNDS ON QUANTUM QUERY COMPLEXITY
    Toran, Jacobo
    Hoyer, Peter
    Spalek, Robert
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2005, (87): : 78 - 103
  • [2] Lower bounds on trellis complexity of block codes
    Lafourcade, A
    Vardy, A
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (06) : 1938 - 1954
  • [3] Lower bounds for query complexity of some graph problems
    Lace, L
    Freivalds, R
    VLSI'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON VLSI, 2003, : 309 - 313
  • [4] Lower bounds for the query complexity of equilibria in Lipschitz games
    Goldberg, Paul W.
    Katzman, Matthew J.
    THEORETICAL COMPUTER SCIENCE, 2023, 962
  • [5] Lower bounds on the state complexity of geometric Goppa codes
    Blackmore, T
    Norton, GH
    DESIGNS CODES AND CRYPTOGRAPHY, 2002, 25 (01) : 95 - 115
  • [6] Lower Bounds on the State Complexity of Geometric Goppa Codes
    T. Blackmore
    G. H. Norton
    Designs, Codes and Cryptography, 2002, 25 : 95 - 115
  • [7] Some graph problems with equivalent lower bounds for query complexity
    Láce, L
    Praude, R
    Freivalds, R
    FCS '05: PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON FOUNDATIONS OF COMPUTER SCIENCE, 2005, : 80 - 86
  • [8] HARDNESS OF CONTINUOUS LOCAL SEARCH: QUERY COMPLEXITY AND CRYPTOGRAPHIC LOWER BOUNDS
    Hubacek, Pavel
    Yogev, Eylon
    SIAM JOURNAL ON COMPUTING, 2020, 49 (06) : 1128 - 1172
  • [9] Lower bounds for randomized and quantum query complexity using Kolmogorov arguments
    Laplante, S
    Magniez, F
    19TH IEEE ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2004, : 294 - 304
  • [10] The Query Complexity of Graph Isomorphism: Bypassing Distribution Testing Lower Bounds
    Onak, Krzysztof
    Sun, Xiaorui
    STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2018, : 165 - 171
12345