{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:38:18Z","timestamp":1773376698043,"version":"3.50.1"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-2200956,CCF-1705028,CCF-2200956,CCF-2312573,CF-2008076,CCF-2312573"],"award-info":[{"award-number":["CCF-2200956,CCF-1705028,CCF-2200956,CCF-2312573,CF-2008076,CCF-2312573"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619326","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"2838-2843","source":"Crossref","is-referenced-by-count":1,"title":["Approximate Locally Decodable Codes with Constant Query Complexity and Nearly Optimal Rate"],"prefix":"10.1109","author":[{"given":"Geoffrey","family":"Mon","sequence":"first","affiliation":[{"name":"University of Texas at Austin,Department of Computer Science,Austin,TX,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dana","family":"Moshkovitz","sequence":"additional","affiliation":[{"name":"University of Texas at Austin,Department of Computer Science,Austin,TX,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Oh","sequence":"additional","affiliation":[{"name":"University of Texas at Austin,Department of Computer Science,Austin,TX,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335315"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/s0097539705446810"},{"key":"ref3","article-title":"A note on amplifying the error-tolerance of locally decodable codes","volume-title":"Electronic Colloquium on Computational Complexity (ECCC), Tech. Rep. TR10\u2013134","author":"Ben-Aroya","year":"2010"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258590"},{"key":"ref5","first-page":"126","article-title":"List-decoding using the XOR lemma","volume-title":"44th Symposium on Foundations of Computer Science (FOCS 2003), 11\u201314 October 2003","author":"Trevisan"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/080734030"},{"issue":"5","key":"ref7","first-page":"29:1","article-title":"Two-query PCP with subconstant error","volume-title":"J. ACM","volume":"57","author":"Moshkovitz","year":"2010"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/100788161"},{"issue":"2","key":"ref9","first-page":"11:1","article-title":"High-rate locally correctable and locally testable codes with sub-polynomial query complexity","volume-title":"J. ACM","volume":"64","author":"Kopparty","year":"2017"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1109\/SFCS.1995.492581","article-title":"Linear time erasure codes with nearly optimal recovery","volume-title":"Proceedings of IEEE 36th Annual Foundations of Computer Science","author":"Alon","year":"1995"},{"issue":"6","key":"ref11","first-page":"1732","article-title":"A linear time erasure-resilient code with nearly optimal recovery","volume-title":"IEEE Trans. Inf. Theory","volume":"42","author":"Alon","year":"1996"},{"issue":"1","key":"ref12","first-page":"1:1","article-title":"Towards 3-query locally decodable codes of subexponential length","volume-title":"J. ACM","volume":"55","author":"Yekhanin","year":"2008"},{"issue":"6","key":"ref13","first-page":"1694","article-title":"3-query locally decodable codes of subexponential length","volume-title":"SIAM J. Comput.","volume":"41","author":"Efremenko","year":"2012"},{"issue":"4","key":"ref14","first-page":"1154","article-title":"Matching vector codes","volume-title":"SIAM J. Comput.","volume":"40","author":"Dvir","year":"2011"},{"key":"ref15","article-title":"New lower bounds for general locally decodable codes","volume-title":"Electronic Colloquium on Computational Complexity (ECCC), Tech. Rep. TR07\u2013006","author":"Woodruff","year":"2007"},{"key":"ref16","first-page":"1438","article-title":"A near-cubic lower bound for 3-query locally decodable codes from semirandom CSP refutation","volume-title":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing, ser. STOC 2023. New York, NY, USA: Association for Computing Machinery","author":"Alrabiah","year":"2023"},{"key":"ref17","article-title":"An exponential lower bound for linear 3-query locally correctable codes","volume-title":"Electronic Colloquium on Computational Complexity (ECCC), Tech. Rep. TR23\u2013162","author":"Kothari","year":"2023"},{"key":"ref18","article-title":"A stronger bound for linear 3-LCC","volume-title":"Electronic Colloquium on Computational Complexity (ECCC), Tech. Rep. TR24\u2013036","author":"Yankovitz","year":"2024"},{"key":"ref19","article-title":"Near-tight bounds for 3-query locally correctable binary linear codes via rainbow cycles","volume-title":"Electronic Colloquium on Computational Complexity (ECCC), Tech. Rep. TR24\u2013062","author":"Alrabiah","year":"2024"},{"issue":"2","key":"ref20","first-page":"509","article-title":"Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs","volume-title":"IEEE Transactions on Information Theory","volume":"38","author":"Alon","year":"1992"},{"issue":"7","key":"ref21","first-page":"1812","article-title":"Covering codes with improved density","volume-title":"IEEE Transactions on Information Theory","volume":"49","author":"Krivelevich","year":"2003"},{"issue":"4","key":"ref22","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1137\/S0097539794268765","article-title":"A Chernoff bound for random walks on expander graphs","volume":"27","author":"Gillman","year":"1998","journal-title":"SIAM Journal on Computing"}],"event":{"name":"2024 IEEE International Symposium on Information Theory (ISIT)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10619013\/10619074\/10619326.pdf?arnumber=10619326","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:45Z","timestamp":1773347265000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619326\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619326","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}