Query-efficient locally decodable codes of subexponential length

DSpace/Manakin Repository


Search DR-NTU

Advanced Search Subject Search


My Account

Query-efficient locally decodable codes of subexponential length

Show simple item record

dc.contributor.author Chee, Yeow Meng
dc.contributor.author Feng, Tao
dc.contributor.author Ling, San
dc.contributor.author Wang, Huaxiong
dc.contributor.author Zhang, Liang Feng
dc.date.accessioned 2012-03-13T05:56:47Z
dc.date.available 2012-03-13T05:56:47Z
dc.date.copyright 2011
dc.date.issued 2012-03-13
dc.identifier.citation 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.
dc.identifier.uri http://hdl.handle.net/10220/7636
dc.description.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.
dc.format.extent 27 p.
dc.language.iso en
dc.relation.ispartofseries Computational complexity
dc.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: http://dx.doi.org/10.1007/s00037-011-0017-1.
dc.subject DRNTU::Science::Mathematics
dc.title Query-efficient locally decodable codes of subexponential length
dc.type Journal Article
dc.contributor.school School of Physical and Mathematical Sciences
dc.identifier.doi http://dx.doi.org/10.1007/s00037-011-0017-1
dc.description.version Accepted version

Files in this item

Files Size Format View
Query-efficient ... subexponential lenghth.pdf 283.9Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record


Total views

All Items Views
Query-efficient locally decodable codes of subexponential length 405

Total downloads

All Bitstreams Views
Query-efficient locally decodable codes of subexponential lenghth.pdf 119

Top country downloads

Country Code Views
United States of America 74
China 19
France 7
Singapore 7
Unknown Country 3

Top city downloads

city Views
Mountain View 46
Singapore 7
Redwood City 5
Sunnyvale 4
Kuala Lumpur 1