Author:
Hemenway Brett,Ostrovsky Rafail
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Katz, J., Trevisan, L.: On the efficiency of local decoding procedures for error-correcting codes. In: STOC 2000: Proceedings of the 32nd Annual Symposium on the Theory of Computing, pp. 80–86 (2000)
2. Yekhanin, S.: Towards 3-Query Locally Decodable Codes of Subexponential Length. In: Proceedings of the 39th ACM Symposiom on the Theory of Computinng (STOC) (2007)
3. Lecture Notes in Computer Science;R.J. Lipton,1994
4. Gopalan, P., Lipton, R.J., Ding, Y.Z.: Error correction against computationally bounded adversaries (manuscript, 2004)
5. Lecture Notes in Computer Science;S. Micali,2005
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Relaxed Local Correctability from Local Testing;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Computationally Relaxed Locally Decodable Codes, Revisited;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25
3. Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
4. Relaxed Locally Correctable Codes in Computationally Bounded Channels;IEEE Transactions on Information Theory;2021-07
5. Is There an Oblivious RAM Lower Bound for Online Reads?;Journal of Cryptology;2021-05-11