Query-Efficient Locally Decodable Codes of Subexponential Length

@article{Chee2010QueryEfficientLD,
  title={Query-Efficient Locally Decodable Codes of Subexponential Length},
  author={Yeow Meng Chee and Tao Feng and San Ling and Huaxiong Wang and Liang Feng Zhang},
  journal={computational complexity},
  year={2010},
  volume={22},
  pages={159-189}
}
Abstract 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 (in J ACM 55:1–16, 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 (in Proceedings of the… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 25 CITATIONS

2-Server PIR with Subpolynomial Communication

VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

A Theory of Locally Decodable Codes

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

How to Correct Errors in Multi-Server PIR

VIEW 1 EXCERPT
CITES BACKGROUND

Is there an Oblivious RAM Lower Bound for Online Reads?

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

3-Query Locally Decodable Codes of Subexponential Length

VIEW 35 EXCERPTS
HIGHLY INFLUENTIAL

Lower bounds for linear locally decodable codes and private information retrieval

VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Towards 3-query locally decodable codes of subexponential length

VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes

VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

A geometric approach to informationtheoretic private information retrieval

  • Springer, Berlin. D. Woodruff, S. Yekhanin
  • SIAM J. Comput
  • 2007

Query-Efficient Locally Decodable Codes

  • C. W. Curtis, I. Reiner
  • AMS Chelsea Publishing, Providence, RI,
  • 2006
VIEW 1 EXCERPT