Towards 3-query locally decodable codes of subexponential length

A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only q bits of the codeword C(x), even after some constant fraction of codeword bits has been corrupted. We give new constructions of three query LDCs of vastly shorter length than that of previous constructions. Specifically, given any Mersenne prime p = 2t - 1, we design three query LDCs of length N = exp n1/t , for every n. Based on the largest known Mersenne prime, this translates to a length of less than exp n10-7 , compared to exp n1/2 in the previous constructions. It has often been conjectured that there are infinitely many Mersenne primes. Under this conjecture, our constructions yield three query locally decodable codes of length N = exp n O 1 log log n for infinitely many n. We also obtain analogous improvements for Private Information Retrieval (PIR) schemes. We give 3-server PIR schemes with communic...

• Type: Conference
• Year: 2007
• Where: STOC
• Authors: Sergey Yekhanin
• Keywords: 3-server Pir Schemes, Algorithms, Private Information Retrieval, Small Dimensional Vector, STOC 2007