Loading jsMath...
Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > SAN LING:
All reports by Author San Ling:

TR10-173 | 9th November 2010
Yeow Meng Chee, Tao Feng, San Ling, Huaxiong Wang, Liang Feng Zhang

Query-Efficient Locally Decodable Codes

A k-query locally decodable code (LDC)
\textbf{C}:\Sigma^{n}\rightarrow \Gamma^{N} encodes each message x into
a codeword \textbf{C}(x) such that each symbol of x can be probabilistically
recovered by querying only k coordinates of \textbf{C}(x), even after a
constant fraction of the coordinates have been corrupted.
Yekhanin (2008)
constructed a 3-query LDC ... more >>>




ISSN 1433-8092 | Imprint