New Locally Decodable Codes and Private Information Retrieval Schemes
نویسنده
چکیده
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 (
منابع مشابه
Locally Decodable Codes and Private Information Retrieval Schemes
This thesis studies two closely related notions, namely Locally Decodable Codes (LDCs) and Private Information Retrieval Schemes (PIRs). Locally decodable codes are error-correcting codes that allow extremely efficient, “sublinear-time” decoding procedures. More formally, a k-query locally decodable code encodes n-bit messages x in such a way that one can probabilistically recover any bit xi of...
متن کاملExponential Lower Bound for 2-Query Locally Decodable Codes
We prove exponential lower bounds on the length of 2-query locally decodable codes. Goldreich et al. recently proved such bounds for the special case of linear locally decodable codes. Our proof shows that a 2-query locally decodable code can be decoded with only 1 quantum query, and then proves an exponential lower bound for such 1-query locally quantum-decodable codes. We also exhibit q-query...
متن کاملImproved Lower Bounds for Locally Decodable Codes and Private Information Retrieval
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding n-bit strings over an l-bit alphabet, where the decoder only uses b bits of each queried position of the codeword, needs code length
متن کاملA Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers
Since the concept of locally decodable codes was introduced by Katz and Trevisan in 2000 [11], it is well-known that information theoretically secure private information retrieval schemes can be built using locally decodable codes [15]. In this paper, we construct a Byzantine robust PIR scheme using the multiplicity codes introduced by Kopparty et al. [12]. Our main contributions are on the one...
متن کاملOptimal Lower Bounds for 2-Query Locally Decodable Linear Codes
This paper presents essentially optimal lower bounds on the size of linear codes C : {0, 1} → {0, 1} which have the property that, for constants δ, > 0, any bit of the message can be recovered with probability 1 2 + by an algorithm reading only 2 bits of a codeword corrupted in up to δm positions. Such codes are known to be applicable to, among other things, the construction and analysis of inf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 13 شماره
صفحات -
تاریخ انتشار 2006