Query-efficient locally decodable codes of subexponential length
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-q...
| Main Authors: | , , , , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2012
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/94604 http://hdl.handle.net/10220/7636 |
| _version_ | 1811695285993209856 |
|---|---|
| author | Chee, Yeow Meng Feng, Tao Ling, San Wang, Huaxiong Zhang, Liang Feng |
| author2 | School of Physical and Mathematical Sciences |
| author_facet | School of Physical and Mathematical Sciences Chee, Yeow Meng Feng, Tao Ling, San Wang, Huaxiong Zhang, Liang Feng |
| author_sort | Chee, Yeow Meng |
| collection | NTU |
| description | 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. |
| first_indexed | 2024-10-01T07:21:03Z |
| format | Journal Article |
| id | ntu-10356/94604 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T07:21:03Z |
| publishDate | 2012 |
| record_format | dspace |
| spelling | ntu-10356/946042023-02-28T19:31:13Z Query-efficient locally decodable codes of subexponential length Chee, Yeow Meng Feng, Tao Ling, San Wang, Huaxiong Zhang, Liang Feng School of Physical and Mathematical Sciences DRNTU::Science::Mathematics 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. Accepted version 2012-03-13T05:56:47Z 2019-12-06T18:59:05Z 2012-03-13T05:56:47Z 2019-12-06T18:59:05Z 2011 2011 Journal Article 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. https://hdl.handle.net/10356/94604 http://hdl.handle.net/10220/7636 10.1007/s00037-011-0017-1 en Computational complexity © 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. 27 p. application/pdf |
| spellingShingle | DRNTU::Science::Mathematics Chee, Yeow Meng Feng, Tao Ling, San Wang, Huaxiong Zhang, Liang Feng Query-efficient locally decodable codes of subexponential length |
| title | Query-efficient locally decodable codes of subexponential length |
| title_full | Query-efficient locally decodable codes of subexponential length |
| title_fullStr | Query-efficient locally decodable codes of subexponential length |
| title_full_unstemmed | Query-efficient locally decodable codes of subexponential length |
| title_short | Query-efficient locally decodable codes of subexponential length |
| title_sort | query efficient locally decodable codes of subexponential length |
| topic | DRNTU::Science::Mathematics |
| url | https://hdl.handle.net/10356/94604 http://hdl.handle.net/10220/7636 |
| work_keys_str_mv | AT cheeyeowmeng queryefficientlocallydecodablecodesofsubexponentiallength AT fengtao queryefficientlocallydecodablecodesofsubexponentiallength AT lingsan queryefficientlocallydecodablecodesofsubexponentiallength AT wanghuaxiong queryefficientlocallydecodablecodesofsubexponentiallength AT zhangliangfeng queryefficientlocallydecodablecodesofsubexponentiallength |