NDLI: Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length

Please wait, while we are loading the content...

Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length

Content Provider	ACM Digital Library
Author	Gal, Anna Mills, Andrew
Copyright Year	2012
Abstract	Locally decodable codes are error-correcting codes with the extra property that, in order to retrieve the value of a single input position, it is sufficient to read a small number of positions of the codeword. We refer to the probability of getting the correct value as the $\textit{correctness}$ of the decoding algorithm. A breakthrough result by Yekhanin [2007] showed that 3-query linear locally decodable codes may have subexponential length. The construction of Yekhanin, and the three query constructions that followed, achieve correctness only up to a certain limit which is $1 ™ 3\textit{Δ}$ for nonbinary codes, where an adversary is allowed to corrupt up to $\textit{Δ}$ fraction of the codeword. The largest correctness for a subexponential length 3-query binary code is achieved in a construction by Woodruff [2008], and it is below $1 ™ 3\textit{Δ}.$ We show that achieving slightly larger correctness (as a function of $\textit{Δ})$ requires exponential codeword length for 3-query codes. Previously, there were no larger than quadratic lower bounds known for locally decodable codes with more than 2 queries, even in the case of 3-query linear codes. Our lower bounds hold for linear codes over arbitrary finite fields and for binary nonlinear codes. Considering larger number of queries, we obtain lower bounds for q-query codes for $\textit{q} > 3,$ under certain assumptions on the decoding algorithm that have been commonly used in previous constructions. We also prove bounds on the largest correctness achievable by these decoding algorithms, regardless of the length of the code. Our results explain the limitations on correctness in previous constructions using such decoding algorithms. In addition, our results imply trade-offs on the parameters of error-correcting data structures.
Starting Page	1
Ending Page	34
Page Count	34
File Format	PDF
ISSN	19423454
e-ISSN	19423462
DOI	10.1145/2077336.2077338
Volume Number	3
Issue Number	2
Journal	ACM Transactions on Computation Theory (TOCT)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2012-01-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Locally decodable codes Lower bounds
Content Type	Text
Resource Type	Article
Subject	Computational Theory and Mathematics Theoretical Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length

Three query locally decodable codes with higher correctness require exponential length

Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length

Lower bounds for linear locally decodable codes and private information retrieval

Towards lower bounds on locally testable codes via density arguments

On Matrix Rigidity and Locally Self-correctable Codes

Query-Efficient Locally Decodable Codes of Subexponential Length

Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions

Exponential lower bounds for depth three Boolean circuits

Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length

Similar Documents

Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length

Three query locally decodable codes with higher correctness require exponential length

Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length

Lower bounds for linear locally decodable codes and private information retrieval

Towards lower bounds on locally testable codes via density arguments

On Matrix Rigidity and Locally Self-correctable Codes

Query-Efficient Locally Decodable Codes of Subexponential Length

Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions

Exponential lower bounds for depth three Boolean circuits

Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length