{"id":"https://openalex.org/W3097401090","doi":"https://doi.org/10.4230/lipics.icalp.2021.18","title":"Relaxed Locally Correctable Codes with Improved Parameters","display_name":"Relaxed Locally Correctable Codes with Improved Parameters","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3097401090","doi":"https://doi.org/10.4230/lipics.icalp.2021.18","mag":"3097401090"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:14087","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.18","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.18","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102748906","display_name":"Vahid R. Asadi","orcid":"https://orcid.org/0000-0001-8354-7463"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Asadi, Vahid R.","raw_affiliation_strings":["Simon Fraser University, Burnaby, Canada"],"affiliations":[{"raw_affiliation_string":"Simon Fraser University, Burnaby, Canada","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028165107","display_name":"Igor Shinkar","orcid":"https://orcid.org/0000-0001-5013-6422"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Shinkar, Igor","raw_affiliation_strings":["Simon Fraser University, Burnaby, Canada"],"affiliations":[{"raw_affiliation_string":"Simon Fraser University, Burnaby, Canada","institution_ids":["https://openalex.org/I18014758"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102748906"],"corresponding_institution_ids":["https://openalex.org/I18014758"],"apc_list":null,"apc_paid":null,"fwci":0.5439,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.7083279,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9987999796867371,"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.9987999796867371,"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/T10237","display_name":"Cryptography and Data Security","score":0.9962000250816345,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9937000274658203,"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/code-word","display_name":"Code word","score":0.8430159091949463},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6494763493537903},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5946441292762756},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5429513454437256},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5338408350944519},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5335192084312439},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49581632018089294},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.444691002368927},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.4356459379196167},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3299905061721802},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19324803352355957},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.1701682209968567}],"concepts":[{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.8430159091949463},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6494763493537903},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5946441292762756},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5429513454437256},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5338408350944519},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5335192084312439},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49581632018089294},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.444691002368927},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4356459379196167},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3299905061721802},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19324803352355957},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.1701682209968567},{"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":"pmh:oai:drops-oai.dagstuhl.de:14087","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.18","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.icalp.2021.18","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2021.18","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"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","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:14087","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.18","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.5,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3186796962","https://openalex.org/W3131688971","https://openalex.org/W2963950088","https://openalex.org/W1545749424","https://openalex.org/W2950268869","https://openalex.org/W2963709616","https://openalex.org/W2617207196","https://openalex.org/W1555149635","https://openalex.org/W2791574816","https://openalex.org/W2949734860","https://openalex.org/W3039463368","https://openalex.org/W2949483158","https://openalex.org/W1598233781","https://openalex.org/W2777137313","https://openalex.org/W2561829520","https://openalex.org/W1567312599","https://openalex.org/W1902733887","https://openalex.org/W2130217481","https://openalex.org/W2977835073","https://openalex.org/W2789230658"],"abstract_inverted_index":{"Locally":[0],"decodable":[1],"codes":[2,6,146,280],"(LDCs)":[3],"are":[4],"error-correcting":[5],"C:":[7],"\u03a3^k":[8],"\u2192":[9],"\u03a3\u207f":[10],"that":[11,17,126,160,186,208],"admit":[12],"a":[13,28,32,78,121,131,157,162,168,205,210,216,232,291,308],"local":[14,113],"decoding":[15,114,139],"algorithm":[16,115,296],"recovers":[18,298],"each":[19,299],"individual":[20,300],"bit":[21,301],"of":[22,41,53,61,68,92,106,164,170,198,212,218,239,276,302,311],"the":[23,46,50,64,82,86,93,103,112,127,196,236,256,263,273,294,303,312,317],"message":[24,163,211],"by":[25,119,203,305],"querying":[26,120],"only":[27,188,306],"few":[29,122],"bits":[30,123],"from":[31],"noisy":[33,292],"codeword.":[34,132],"An":[35],"important":[36],"question":[37],"in":[38,90,262,283],"this":[39,192],"line":[40],"research":[42],"is":[43,77,129,319],"to":[44,101,116,137,231,272,321],"understand":[45],"optimal":[47],"trade-off":[48],"between":[49,81,258],"query":[51,70,143,249,265],"complexity":[52,144],"LDCs":[54,71,108,259],"and":[55,75,85,242,260],"their":[56],"block":[57,94,171,219],"length.":[58,95,150],"Despite":[59],"importance":[60],"these":[62],"objects,":[63],"best":[65,83],"known":[66,87],"constructions":[67,84],"constant":[69,142,185,234,248,264],"have":[72],"super-polynomial":[73],"length,":[74],"there":[76],"significant":[79],"gap":[80,257],"lower":[88,237],"bounds":[89,238],"terms":[91],"For":[96],"many":[97],"applications":[98],"it":[99,124],"suffices":[100],"consider":[102],"weaker":[104],"notion":[105,275],"relaxed":[107,277],"(RLDCs),":[109],"which":[110],"allows":[111],"abort":[117],"if":[118,316],"detects":[125],"input":[128,318],"not":[130],"This":[133,227],"relaxation":[134],"turned":[135],"out":[136],"allow":[138],"algorithms":[140],"with":[141,147],"for":[145,176,222,247],"almost":[148],"linear":[149],"Specifically,":[151],"[{Ben-Sasson}":[152,199],"et":[153,200,286],"al.,":[154,201,287],"2006]":[155,202],"constructed":[156],"q-query":[158,206],"RLDC":[159,207],"encodes":[161,209],"length":[165,172,213,220],"k":[166,214],"using":[167,215],"codeword":[169,217,293,304],"n":[173],"=":[174],"O_q(k^{1+O(1/\u221aq)})":[175],"any":[177,223],"sufficiently":[178,224],"large":[179,225],"q,":[180],"where":[181,289],"O_q(\u22c5)":[182],"hides":[183],"some":[184],"depends":[187],"on":[189],"q.":[190,226],"In":[191,267],"work":[193],"we":[194],"improve":[195],"parameters":[197],"constructing":[204],"O_q(k^{1+O(1/{q})})":[221],"construction":[228,270],"matches":[229],"(up":[230],"multiplicative":[233],"factor)":[235],"[Jonathan":[240],"Katz":[241],"Trevisan,":[243],"2000;":[244],"Woodruff,":[245],"2007]":[246],"LDCs,":[250],"thus":[251],"making":[252],"progress":[253],"toward":[254],"understanding":[255],"RLDCs":[261],"regime.":[266],"fact,":[268],"our":[269],"extends":[271],"stronger":[274],"locally":[278],"correctable":[279],"(RLCCs),":[281],"introduced":[282],"[Tom":[284],"Gur":[285],"2018],":[288],"given":[290],"correcting":[295],"either":[297],"reading":[307],"small":[309],"part":[310],"input,":[313],"or":[314],"aborts":[315],"detected":[320],"be":[322],"corrupt.":[323]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}