{"id":"https://openalex.org/W3082318583","doi":"https://doi.org/10.1137/20m135515x","title":"Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity","display_name":"Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity","publication_year":2022,"publication_date":"2022-12-15","ids":{"openalex":"https://openalex.org/W3082318583","doi":"https://doi.org/10.1137/20m135515x","mag":"3082318583"},"language":"en","primary_location":{"id":"doi:10.1137/20m135515x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m135515x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/299849","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101591310","display_name":"Alessandro Chiesa","orcid":"https://orcid.org/0000-0002-3029-2353"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alessandro Chiesa","raw_affiliation_strings":["UC Berkeley, Berkeley, CA 94720 USA, and EPFL, 1015 Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"UC Berkeley, Berkeley, CA 94720 USA, and EPFL, 1015 Lausanne, Switzerland","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074192050","display_name":"Tom Gur","orcid":"https://orcid.org/0000-0001-7864-7013"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Tom Gur","raw_affiliation_strings":["University of Warwick, Coventry CV4 7AL, UK"],"affiliations":[{"raw_affiliation_string":"University of Warwick, Coventry CV4 7AL, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028165107","display_name":"Igor Shinkar","orcid":"https://orcid.org/0000-0001-5013-6422"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Igor Shinkar","raw_affiliation_strings":["Simon Fraser University, Burnaby V5A 1S6, BC, Canada"],"affiliations":[{"raw_affiliation_string":"Simon Fraser University, Burnaby V5A 1S6, BC, Canada","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101591310"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7303,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.71198974,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"51","issue":"6","first_page":"1839","last_page":"1865"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.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/T12288","display_name":"Optimization and Search Problems","score":0.9948999881744385,"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/mathematics","display_name":"Mathematics","score":0.605280339717865},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.6012529134750366},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5833873748779297},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.529019832611084},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.4950079321861267},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.49448251724243164},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4879295527935028},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4358808994293213},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33330273628234863},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33325207233428955},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.28862982988357544},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.25533750653266907},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.20064714550971985}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.605280339717865},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6012529134750366},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5833873748779297},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.529019832611084},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4950079321861267},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.49448251724243164},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4879295527935028},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4358808994293213},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33330273628234863},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33325207233428955},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28862982988357544},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25533750653266907},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.20064714550971985},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/20m135515x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m135515x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:infoscience.epfl.ch:299849","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/299849","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"WoS","raw_type":"research article"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:299849","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/299849","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"WoS","raw_type":"research article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1998698985","https://openalex.org/W2004229705","https://openalex.org/W2014860393","https://openalex.org/W2019578639","https://openalex.org/W2022381972","https://openalex.org/W2027317757","https://openalex.org/W2038691311","https://openalex.org/W2044199052","https://openalex.org/W2087900794","https://openalex.org/W2125632628","https://openalex.org/W2148352980","https://openalex.org/W2153413398","https://openalex.org/W2242452602","https://openalex.org/W2473767456","https://openalex.org/W2594013878","https://openalex.org/W4226046050","https://openalex.org/W4256317935"],"related_works":["https://openalex.org/W3017203753","https://openalex.org/W3083229674","https://openalex.org/W4205451769","https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W3096151594","https://openalex.org/W2964031101","https://openalex.org/W2983681086","https://openalex.org/W4200209838","https://openalex.org/W2165241191"],"abstract_inverted_index":{"Locally":[0],"correctable":[1],"codes":[2,7,44,82,147],"(LCCs)":[3],"are":[4,231],"error":[5],"correcting":[6,142],"C":[8],":":[9],"\\Sigmak":[10],"\\rightarrow":[11],"\\Sigman":[12],"which":[13,111,227],"admit":[14,88],"local":[15,92,154],"algorithms":[16,90,145],"that":[17,40,175,181,229],"correct":[18],"any":[19],"individual":[20,53],"symbol":[21],"of":[22,30,41,55,59,80,106,125,161,281],"a":[23,27,122,129],"corrupted":[24],"codeword":[25],"via":[26],"minuscule":[28],"number":[29],"queries.":[31],"For":[32],"systematic":[33],"codes,":[34],"this":[35,133],"notion":[36],"is":[37,49,67],"stronger":[38],"than":[39],"locally":[42],"decodable":[43],"(LDCs),":[45],"where":[46],"the":[47,56,60,100,113,126,162,221,224,247,266,282],"goal":[48],"to":[50,68,87,116,131,139],"only":[51],"recover":[52],"symbols":[54],"message.":[57],"One":[58],"central":[61],"problems":[62],"in":[63,165,285],"algorithmic":[64],"coding":[65],"theory":[66],"construct":[69,198],"O(1)-query":[70,89,178,200,233],"LCCs":[71,108,180,235],"and":[72,94,109,143,158,278],"LDCs":[73,264],"with":[74,148,203,236,265],"minimal":[75],"block":[76,85,150,184,205,237],"length.":[77,151],"Alas,":[78],"state-of-the-art":[79],"such":[81],"requires":[83],"super-polynomial":[84],"length":[86,185,206,238],"for":[91,146,189,210],"correction":[93,114],"decoding,":[95],"despite":[96],"much":[97],"attention":[98],"during":[99],"last":[101],"two":[102],"decades.":[103],"The":[104],"study":[105],"relaxed":[107,179,201,234,263],"LDCs,":[110],"allow":[112,140],"algorithm":[115],"abort":[117],"(but":[118],"not":[119],"err)":[120],"on":[121,153],"small":[123,192,213],"fraction":[124],"locations,":[127],"provides":[128],"way":[130],"circumvent":[132],"barrier.":[134],"This":[135,218,269],"relaxation":[136],"turned":[137],"out":[138],"constant-query":[141],"decoding":[144],"polynomial":[149],"Focusing":[152],"correction,":[155],"Gur,":[156,276],"Ramnarayan,":[157,277],"Rothblum":[159,279],"[Proceedings":[160,280],"9th":[163,283],"Innovations":[164,284],"Theoretical":[166,286],"Computer":[167,287],"Science":[168,288],"Conference,":[169,289],"ITCS'18,":[170,290],"2018,":[171,291],"pp.":[172,259,292],"1--27]":[173],"showed":[174],"there":[176,230],"exist":[177],"achieve":[182],"nearly-quartic":[183],"n":[186,207,239],"=":[187,208,240],"k4+\\alpha,":[188],"an":[190,199,211,271],"arbitrarily":[191,212],"constant":[193,214],"\\alpha":[194,215],">":[195,216],"0.":[196,217],"We":[197],"LCC":[202],"nearly-linear":[204],"k1+\\alpha,":[209],"significantly":[219],"narrows":[220],"gap":[222],"between":[223],"lower":[225],"bound":[226],"states":[228],"no":[232],"k1+o(1).":[241],"In":[242],"particular,":[243],"our":[244],"construction":[245],"matches":[246],"parameters":[248],"achieved":[249],"by":[250,275],"Ben-Sasson":[251],"et":[252],"al.":[253],"[SIAM":[254],"J.":[255],"Comput.,":[256],"36":[257],"(2006),":[258],"889--974],":[260],"who":[261],"constructed":[262],"same":[267],"parameters.":[268],"resolves":[270],"open":[272],"problem":[273],"raised":[274],"1--27].":[293]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}