Three-query locally decodable codes with higher correctness require exponential length

被引：1
|
作者：
Gal, Anna [1 ]
Mills, Andrew [1 ]
机构：
[1] Department of Computer Science, University of Texas, Austin, TX, United States
来源：
ACM Transactions on Computation Theory | 2012年 / 3卷 / 02期
关键词：
27;
D O I：
10.1145/2077336.2077338
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 20 条
  • [1] Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length
    Gal, Anna
    Mills, Andrew
    28TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2011), 2011, 9 : 673 - 684
  • [2] A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field
    Woodruff, David P.
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2012, 27 (04) : 678 - 686
  • [3] A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field
    Woodruff, David P.
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2010, 6302 : 766 - 779
  • [4] A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field
    David P. Woodruff
    Journal of Computer Science and Technology, 2012, 27 : 678 - 686
  • [5] A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field
    David P.Woodruff
    Journal of Computer Science & Technology, 2012, 27 (04) : 678 - 686
  • [6] 3-Query Locally Decodable Codes of Subexponential Length
    Efremenko, Klim
    STOC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2009, : 39 - 44
  • [7] Query-Efficient Locally Decodable Codes of Subexponential Length
    Chee, Yeow Meng
    Feng, Tao
    Ling, San
    Wang, Huaxiong
    Zhang, Liang Feng
    COMPUTATIONAL COMPLEXITY, 2013, 22 (01) : 159 - 189
  • [8] 3-QUERY LOCALLY DECODABLE CODES OF SUBEXPONENTIAL LENGTH
    Efremenko, Klim
    SIAM JOURNAL ON COMPUTING, 2012, 41 (06) : 1694 - 1703
  • [9] Query-Efficient Locally Decodable Codes of Subexponential Length
    Yeow Meng Chee
    Tao Feng
    San Ling
    Huaxiong Wang
    Liang Feng Zhang
    computational complexity, 2013, 22 : 159 - 189
  • [10] Towards 3-query locally decodable codes of subexponential length
    Yekhanin, Sergey
    JOURNAL OF THE ACM, 2008, 55 (01)
12