{"id":"https://openalex.org/W4401693759","doi":"https://doi.org/10.1109/isit57864.2024.10619326","title":"Approximate Locally Decodable Codes with Constant Query Complexity and Nearly Optimal Rate","display_name":"Approximate Locally Decodable Codes with Constant Query Complexity and Nearly Optimal Rate","publication_year":2024,"publication_date":"2024-07-07","ids":{"openalex":"https://openalex.org/W4401693759","doi":"https://doi.org/10.1109/isit57864.2024.10619326"},"language":"en","primary_location":{"id":"doi:10.1109/isit57864.2024.10619326","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit57864.2024.10619326","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050309474","display_name":"Geoffrey Mon","orcid":"https://orcid.org/0000-0003-4414-1019"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Geoffrey Mon","raw_affiliation_strings":["University of Texas at Austin,Department of Computer Science,Austin,TX,USA"],"affiliations":[{"raw_affiliation_string":"University of Texas at Austin,Department of Computer Science,Austin,TX,USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023279342","display_name":"Dana Moshkovitz","orcid":"https://orcid.org/0000-0002-4151-568X"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dana Moshkovitz","raw_affiliation_strings":["University of Texas at Austin,Department of Computer Science,Austin,TX,USA"],"affiliations":[{"raw_affiliation_string":"University of Texas at Austin,Department of Computer Science,Austin,TX,USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065865067","display_name":"Justin Oh","orcid":"https://orcid.org/0000-0002-4422-6365"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Justin Oh","raw_affiliation_strings":["University of Texas at Austin,Department of Computer Science,Austin,TX,USA"],"affiliations":[{"raw_affiliation_string":"University of Texas at Austin,Department of Computer Science,Austin,TX,USA","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5050309474"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":0.3637,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.65747518,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"2838","last_page":"2843"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9866999983787537,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9866999983787537,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9822999835014343,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9778000116348267,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6399470567703247},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5972774028778076},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.47783327102661133},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.45103275775909424},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3480950593948364},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3301193118095398},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2587841749191284},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.11340254545211792}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6399470567703247},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5972774028778076},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.47783327102661133},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.45103275775909424},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3480950593948364},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3301193118095398},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2587841749191284},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.11340254545211792},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit57864.2024.10619326","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit57864.2024.10619326","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8275536480","display_name":null,"funder_award_id":"CCF-2200956,CCF-1705028,CCF-2200956,CCF-2312573,CF-2008076,CCF-2312573","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1880538223","https://openalex.org/W1967703498","https://openalex.org/W1989019709","https://openalex.org/W2021736779","https://openalex.org/W2044199052","https://openalex.org/W2125632628","https://openalex.org/W2139964991","https://openalex.org/W4200283578","https://openalex.org/W6607467174","https://openalex.org/W6607703444","https://openalex.org/W6610275628","https://openalex.org/W6629871333","https://openalex.org/W6650209104","https://openalex.org/W6656854955","https://openalex.org/W6675910352","https://openalex.org/W6676073293","https://openalex.org/W6676546595","https://openalex.org/W6678271250","https://openalex.org/W6680661067","https://openalex.org/W6852812864","https://openalex.org/W6858161655","https://openalex.org/W6864385205","https://openalex.org/W6874742066"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793","https://openalex.org/W4238204885"],"abstract_inverted_index":{"We":[0,121,168,192,202],"present":[1,122],"simple":[2],"constructions":[3],"of":[4,14,20,55,107,125,142,157,245],"good":[5],"approxi-mate":[6],"locally":[7,31],"decodable":[8,32],"codes":[9],"(ALDCs)":[10],"in":[11],"the":[12,52,90,173],"presence":[13],"a":[15,29,39,56,71,101,123,139,232],"<tex":[16,23,34,41,47,58,66,74,79,84,92,103,108,112,118,132,144,177,185,189,198,215,220,227,239],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[17,24,35,42,48,59,67,75,80,85,93,104,109,113,119,133,145,178,186,190,199,216,221,228,240],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\delta{-}$</tex>":[18],"fraction":[19,106],"errors":[21],"for":[22,111,128,183,195,212,226],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\delta":[25],"&lt;":[26],"1/2$</tex>.":[27],"In":[28,87,224],"standard":[30],"code":[33],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$C:\\Sigma_{1}^{k}\\rightarrow\\Sigma_{2}^{n}$</tex>,":[36],"there":[37,206],"is":[38,78,172,248],"decoder":[40,91],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$M$</tex>":[43,94],"that":[44,77,194,205,218],"on":[45,100],"input":[46],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$i\\in[k]$</tex>":[49,110],"correctly":[50],"outputs":[51],"i-th":[53],"symbol":[54],"message":[57],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$x$</tex>":[60],"(with":[61],"high":[62],"probability)":[63],"using":[64],"only":[65,95],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$q$</tex>":[68,146,217],"queries":[69,143,158],"to":[70,83,97,165],"given":[72],"string":[73],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$w$</tex>":[76],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\Delta$</tex>":[81],"-close":[82],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$C(x)$</tex>.":[86],"an":[88],"ALDC,":[89,197],"needs":[96],"be":[98,166],"correct":[99],"1":[102],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$-\\varepsilon$</tex>":[105],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\varepsilon$</tex>":[114,179],"much":[115],"smaller":[116],"than":[117],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\delta$</tex>.":[120],"construction":[124],"explicit":[126,208],"ALDCs":[127,211],"all":[129],"constants":[130],"1/2":[131],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$&gt;":[134],"\\delta":[135],"&gt;":[136],"\\varepsilon$</tex>":[137],"with":[138,148,154,236],"constant":[140,155,161,209,214,233],"number":[141,156],"and":[147,159,188],"constant,":[149],"near-optimal":[150],"rate.":[151],"Standard":[152],"LDCs":[153],"any":[160,196,213],"rate":[162,210,234],"are":[163],"known":[164],"impossible.":[167],"additionally":[169],"explore":[170],"what":[171],"lowest":[174],"error":[175,237],"probability":[176,238],"one":[180],"can":[181],"achieve":[182,219],"fixed":[184],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\delta$</tex>":[187],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$q$</tex>.":[191],"show":[193,204],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\in=\\Omega(\\delta":[200],"\\mathrm{r}q/2\\rceil)$</tex>.":[201],"then":[203],"exist":[207],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\varepsilon=O(\\delta^{\\lceil":[222],"q/2\\rceil})$</tex>.":[223],"particular,":[225],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$q=3$</tex>,":[229],"we":[230],"have":[231],"ALDC":[235],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\varepsilon=O(\\delta^{2})$</tex>.":[241],"A":[242],"full":[243],"version":[244],"this":[246],"paper":[247],"available":[249],"at":[250],"https://eccc.weizmann.ac.il/report/2023/056/.":[251]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-12-26T23:08:49.675405","created_date":"2025-10-10T00:00:00"}