Please use this identifier to cite or link to this item:
Title: Query-efficient locally decodable codes of subexponential length
Authors: Chee, Yeow Meng
Feng, Tao
Ling, San
Wang, Huaxiong
Zhang, Liang Feng
Keywords: DRNTU::Science::Mathematics
Issue Date: 2011
Source: Chee, Y. M., Feng, T., Ling, S., Wang, H., & Zhang, L. F. (2011). Query-efficient locally decodable codes of subexponential length. Computational Complexity, 1-31.
Series/Report no.: Computational complexity
Abstract: A k-query locally decodable code (LDC) C : Σn → ΓN encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordinates of C(x), even after a constant fraction of the coordinates has been corrupted. Yekhanin (2008) constructed a 3-query LDC of subexponential length, N = exp(exp(O(log n/log log n))), under the assumption that there are infinitely many Mersenne primes. Efremenko (2009) constructed a 3-query LDC of length N2=exp(exp(O(√(lognloglogn))) with no assumption, and a 2r -query LDC of length Nr=exp(exp(O(r√(logn(loglogn)^(r-1))), for every integer r ≥ 2. Itoh and Suzuki (2010) gave a composition method in Efremenko’s framework and constructed a 3 · 2r-2-query LDC of length Nr, for every integer r ≥ 4, which improved the query complexity of Efremenko’s LDC of the same length by a factor of 3/4. The main ingredient of Efremenko’s construction is the Grolmusz construction for super-polynomial size set-systems with restricted intersections, over Zm , where m possesses a certain “good” algebraic property (related to the “algebraic niceness” property of Yekhanin (2008)). Efremenko constructed a 3-query LDC based on m = 511 and left as an open problem to find other numbers that offer the same property for LDC constructions. In this paper, we develop the algebraic theory behind the constructions of Yekhanin (2008) and Efremenko (2009), in an attempt to understand the “algebraic niceness” phenomenon in Zm. We show that every integer m = pq = 2t −1, where p, q, and t are prime, possesses the same good algebraic property as m = 511 that allows savings in query complexity. We identify 50 numbers of this form by computer search, which together with 511, are then applied to gain improvements on query complexity via Itoh and Suzuki’s composition method. More precisely, we construct a 3⌈r/2⌉-query LDC for every positive integer r < 104 and a⌊(3/4)51·2r⌋-query LDC for every integer r ≥ 104, both of length Nr , improving the 2r queries used by Efremenko (2009) and 3 · 2r-2 queries used by Itoh and Suzuki (2010). We also obtain new efficient private information retrieval (PIR) schemes from the new query-efficient LDCs.
DOI: 10.1007/s00037-011-0017-1
Rights: © 2011 Springer Basel AG .This is the author created version of a work that has been peer reviewed and accepted for publication by Computational Complexity, Springer Basel AG.It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at:
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SPMS Journal Articles

Files in This Item:
File Description SizeFormat 
Query-efficient locally decodable codes of subexponential lenghth.pdf277.33 kBAdobe PDFThumbnail

Citations 20

checked on Sep 5, 2020


checked on Sep 25, 2020

Page view(s)

checked on Sep 28, 2020


checked on Sep 28, 2020

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.