{"id":"https://openalex.org/W1550497999","doi":"https://doi.org/10.1145/2077336.2077338","title":"Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length","display_name":"Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W1550497999","doi":"https://doi.org/10.1145/2077336.2077338","mag":"1550497999"},"language":"en","primary_location":{"id":"doi:10.1145/2077336.2077338","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2077336.2077338","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://hal.science/hal-00573626","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078455094","display_name":"Anna G\u00e1l","orcid":"https://orcid.org/0000-0001-9772-3966"},"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":"Anna Gal","raw_affiliation_strings":["University of Texas at Austin","University of Texas at Austin#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Texas at Austin","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"University of Texas at Austin#TAB#","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054669363","display_name":"Andrew Mills","orcid":null},"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":"Andrew Mills","raw_affiliation_strings":["University of Texas at Austin","University of Texas at Austin#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Texas at Austin","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"University of Texas at Austin#TAB#","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078455094"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04917089,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":"2","first_page":"1","last_page":"34"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9991999864578247,"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.9991999864578247,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9919000267982483,"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/T10237","display_name":"Cryptography and Data Security","score":0.9904999732971191,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7759621143341064},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.6971182227134705},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5219235420227051},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.512603223323822},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.5055978298187256},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4971790611743927},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.47917070984840393},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.472076416015625},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.45944276452064514},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44201308488845825},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4025425910949707},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36444681882858276},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.26612889766693115},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.21103277802467346},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.12382477521896362},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.09431704878807068}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7759621143341064},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6971182227134705},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5219235420227051},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.512603223323822},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.5055978298187256},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4971790611743927},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.47917070984840393},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.472076416015625},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.45944276452064514},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44201308488845825},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4025425910949707},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36444681882858276},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.26612889766693115},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.21103277802467346},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.12382477521896362},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.09431704878807068},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/2077336.2077338","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2077336.2077338","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.296.8056","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.296.8056","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utexas.edu/users/panni/ldc030811.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.600.661","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.600.661","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://subs.emis.de/LIPIcs/volltexte/2011/3053/pdf/61_.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00573626v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00573626","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Theoretical Aspects of Computer Science (STACS2011), Mar 2011, Dortmund, Germany. pp.673-684","raw_type":"Conference papers"},{"id":"mag:1550497999","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc18.html#GalM11","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":{"id":"pmh:oai:HAL:hal-00573626v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00573626","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Theoretical Aspects of Computer Science (STACS2011), Mar 2011, Dortmund, Germany. pp.673-684","raw_type":"Conference papers"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6600000262260437,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G135889731","display_name":null,"funder_award_id":"CCF-0830756CCF-1018060","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"}],"funders":[{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W144891566","https://openalex.org/W1964089073","https://openalex.org/W1967703498","https://openalex.org/W2000211775","https://openalex.org/W2021999231","https://openalex.org/W2027857542","https://openalex.org/W2053086236","https://openalex.org/W2063130531","https://openalex.org/W2073240615","https://openalex.org/W2074064997","https://openalex.org/W2078058008","https://openalex.org/W2082846050","https://openalex.org/W2102801247","https://openalex.org/W2109782186","https://openalex.org/W2120217745","https://openalex.org/W2120282110","https://openalex.org/W2120296961","https://openalex.org/W3145604423"],"related_works":["https://openalex.org/W2128636284","https://openalex.org/W3097401090","https://openalex.org/W1555149635","https://openalex.org/W2949734860","https://openalex.org/W2617207196","https://openalex.org/W304297541","https://openalex.org/W3131688971","https://openalex.org/W1904286506","https://openalex.org/W2475960449","https://openalex.org/W1598233781","https://openalex.org/W2072549963","https://openalex.org/W2130217481","https://openalex.org/W2406599719","https://openalex.org/W1486410891","https://openalex.org/W1965882514","https://openalex.org/W2148599432","https://openalex.org/W2991546740","https://openalex.org/W1986921475","https://openalex.org/W3081454597","https://openalex.org/W1902733887"],"abstract_inverted_index":{"Locally":[0],"decodable":[1,63,170],"codes":[2,5,64,171,191,212],"are":[3],"error-correcting":[4,276],"with":[6,172],"the":[7,15,33,38,42,46,49,74,109,179,221,237,247,250,255,273],"extra":[8],"property":[9],"that,":[10],"in":[11,123,178,229,259],"order":[12],"to":[13,25,37,84,102,105],"retrieve":[14],"value":[16,44],"of":[17,30,32,40,48,71,108,148,181,204,246,249,275],"a":[18,27,85,115,124,146],"single":[19],"input":[20],"position,":[21],"it":[22,130],"is":[23,89,100,121,131],"sufficient":[24],"read":[26],"small":[28],"number":[29,203],"positions":[31],"codeword.":[34,110],"We":[35,138,232],"refer":[36],"probability":[39],"getting":[41],"correct":[43],"as":[45],"correctness":[47,81,113,144,239,258],"decoding":[50,222,243,264],"algorithm.":[51],"A":[52],"breakthrough":[53],"result":[54],"by":[55,126,241],"Yekhanin":[56],"[2007]":[57],"showed":[58],"that":[59,78,140,224],"3-query":[60,118,156,182],"linear":[61,183,190],"locally":[62,169],"may":[65],"have":[66,225],"subexponential":[67,116],"length.":[68],"The":[69,111],"construction":[70,125],"Yekhanin,":[72],"and":[73,129,196],"three":[75],"query":[76],"constructions":[77,261],"followed,":[79],"achieve":[80],"only":[82],"up":[83,104],"certain":[86,218],"limit":[87],"which":[88],"1":[90,133],"\u2212":[91,134],"3":[92,135],"\u03b4":[93,106,136,149],"for":[94,114,155,168,189,197,210,213],"nonbinary":[95],"codes,":[96],"where":[97],"an":[98],"adversary":[99],"allowed":[101],"corrupt":[103],"fraction":[107],"largest":[112,238],"length":[117,154,248],"binary":[119,198],"code":[120],"achieved":[122],"Woodruff":[127],"[2008],":[128],"below":[132],".":[137],"show":[139],"achieving":[141],"slightly":[142],"larger":[143,162,202],"(as":[145],"function":[147],")":[150],"requires":[151],"exponential":[152],"codeword":[153],"codes.":[157,184,200],"Previously,":[158],"there":[159],"were":[160],"no":[161],"than":[163,174],"quadratic":[164],"lower":[165,186,208],"bounds":[166,187,209,235],"known":[167],"more":[173],"2":[175],"queries,":[176,205],"even":[177],"case":[180],"Our":[185,252],"hold":[188],"over":[192],"arbitrary":[193],"finite":[194],"fields":[195],"nonlinear":[199],"Considering":[201],"we":[206],"obtain":[207],"q-query":[211],"q":[214],">":[215],"3,":[216],"under":[217],"assumptions":[219],"on":[220,236,257,272],"algorithm":[223],"been":[226],"commonly":[227],"used":[228],"previous":[230,260],"constructions.":[231],"also":[233],"prove":[234],"achievable":[240],"these":[242],"algorithms,":[244],"regardless":[245],"code.":[251],"results":[253,269],"explain":[254],"limitations":[256],"using":[262],"such":[263],"algorithms.":[265],"In":[266],"addition,":[267],"our":[268],"imply":[270],"trade-offs":[271],"parameters":[274],"data":[277],"structures.":[278]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}