{"id":"https://openalex.org/W2963581626","doi":"https://doi.org/10.1109/isit.2019.8849322","title":"Relaxed Locally Correctable Codes in Computationally Bounded Channels","display_name":"Relaxed Locally Correctable Codes in Computationally Bounded Channels","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2963581626","doi":"https://doi.org/10.1109/isit.2019.8849322","mag":"2963581626"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849322","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849322","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 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/A5028278191","display_name":"Jeremiah Blocki","orcid":"https://orcid.org/0000-0002-5542-4674"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jeremiah Blocki","raw_affiliation_strings":["Department of Computer Science, Purdue University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Purdue University","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089321118","display_name":"Venkata Gandikota","orcid":"https://orcid.org/0000-0003-2381-7788"},"institutions":[{"id":"https://openalex.org/I33434090","display_name":"University of Massachusetts Boston","ror":"https://ror.org/04ydmy275","country_code":"US","type":"education","lineage":["https://openalex.org/I33434090"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Venkata Gandikota","raw_affiliation_strings":["College of Information and Computer Science, University of Massachusetts"],"affiliations":[{"raw_affiliation_string":"College of Information and Computer Science, University of Massachusetts","institution_ids":["https://openalex.org/I33434090"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090091569","display_name":"Elena Grigorescu","orcid":"https://orcid.org/0000-0001-9673-4313"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Elena Grigorescu","raw_affiliation_strings":["Department of Computer Science, Purdue University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Purdue University","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018283928","display_name":"Samson Zhou","orcid":"https://orcid.org/0000-0001-8288-5698"},"institutions":[{"id":"https://openalex.org/I592451","display_name":"Indiana University","ror":"https://ror.org/01kg8sb98","country_code":"US","type":"education","lineage":["https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Samson Zhou","raw_affiliation_strings":["School of Informatics, Computing, and Engineering, Indiana University"],"affiliations":[{"raw_affiliation_string":"School of Informatics, Computing, and Engineering, Indiana University","institution_ids":["https://openalex.org/I592451"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5028278191"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":1.5916,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.87777512,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2414","last_page":"2418"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9990000128746033,"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.9990000128746033,"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/T12029","display_name":"DNA and Biological Computing","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6149101257324219},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.607208788394928},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3561951518058777},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34137386083602905},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.206906259059906}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6149101257324219},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.607208788394928},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3561951518058777},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34137386083602905},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.206906259059906},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2019.8849322","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849322","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W32469654","https://openalex.org/W127527215","https://openalex.org/W162271542","https://openalex.org/W1484143370","https://openalex.org/W1505096007","https://openalex.org/W1967703498","https://openalex.org/W1996839061","https://openalex.org/W1998698985","https://openalex.org/W2001766583","https://openalex.org/W2014860393","https://openalex.org/W2027317757","https://openalex.org/W2039317858","https://openalex.org/W2044199052","https://openalex.org/W2053086236","https://openalex.org/W2063130531","https://openalex.org/W2066775922","https://openalex.org/W2073346043","https://openalex.org/W2082647621","https://openalex.org/W2102300387","https://openalex.org/W2110544982","https://openalex.org/W2117142774","https://openalex.org/W2171179652","https://openalex.org/W2177108502","https://openalex.org/W2242452602","https://openalex.org/W2293231900","https://openalex.org/W2295804537","https://openalex.org/W2484106744","https://openalex.org/W2508919161","https://openalex.org/W2511761010","https://openalex.org/W2561829520","https://openalex.org/W2613194369","https://openalex.org/W2616005523","https://openalex.org/W2617207196","https://openalex.org/W2729715767","https://openalex.org/W2765893588","https://openalex.org/W2784847383","https://openalex.org/W2963279554","https://openalex.org/W2963581626","https://openalex.org/W3004537778","https://openalex.org/W3098556943","https://openalex.org/W6601338367","https://openalex.org/W6630104243","https://openalex.org/W6660569942","https://openalex.org/W6724899558","https://openalex.org/W6730876881","https://openalex.org/W6745682688","https://openalex.org/W6748607611"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"Error-correcting":[0],"codes":[1,103,130,152,199],"that":[2,40],"admit":[3],"local":[4,42,225],"decoding":[5,43],"and":[6,52,108,122,137,149,195,208,224],"correcting":[7],"algorithms":[8],"have":[9],"been":[10],"the":[11,28,33,38,41,50,53,58,68,88,132,135,175,178,201],"focus":[12],"of":[13,35,37,49,55,100,146,177,191,234],"much":[14],"recent":[15,231],"research":[16],"due":[17],"to":[18,26],"their":[19,216],"numerous":[20],"applications.":[21],"An":[22],"important":[23],"goal":[24],"is":[25,174],"obtain":[27],"best":[29],"possible":[30],"tradeoffs":[31,70],"between":[32],"number":[34],"symbols":[36],"codeword":[39],"algorithm":[44],"must":[45],"examine":[46],"(the":[47,60],"locality":[48,107],"task),":[51],"amount":[54],"redundancy":[56],"in":[57,87,131,153,158],"encoding":[59],"information":[61,206],"rate).In":[62],"Hamming\u2019s":[63],"classical":[64,217],"adversarial":[65,91,156],"channel":[66,92],"model,":[67,93],"current":[69],"are":[71],"dramatic,":[72],"allowing":[73],"either":[74],"small":[75,81,106,109],"locality,":[76],"but":[77,83,111],"superpolynomial":[78],"blocklength,":[79,82,110],"or":[80,164],"high":[84],"locality.":[85],"However,":[86],"computationally":[89,154],"bounded,":[90,155],"proposed":[94],"by":[95],"Lipton":[96],"(STACS":[97],"1994),":[98],"constructions":[99,113,190,233],"locally":[101,128,147,150,193,197],"decodable":[102,129,148,198],"suddenly":[104],"exhibit":[105],"these":[112],"require":[114,173],"strong":[115],"trusted":[116],"setup":[117,170],"assumptions":[118],"e.g.,":[119],"Ostrovsky,":[120],"Pandey":[121],"Sahai":[123],"(ICALP":[124],"2007)":[125],"construct":[126],"private":[127],"setting":[133,160],"where":[134],"sender":[136],"receiver":[138],"already":[139],"share":[140],"a":[141,159,183],"symmetric":[142],"key.We":[143],"study":[144],"variants":[145],"correctable":[151,194],"channels,":[157],"with":[161,204,215],"no":[162],"public-key":[163],"private-key":[165],"cryptographic":[166,232],"setup.":[167],"The":[168],"only":[169],"assumption":[171],"we":[172,188],"selection":[176],"public":[179],"parameters":[180],"(seed)":[181],"for":[182],"collision-resistant":[184,221],"hash":[185,222],"function.":[186],"Specifically,":[187],"provide":[189],"relaxed":[192,196],"over":[200],"binary":[202],"alphabet,":[203],"constant":[205],"rate,":[207],"poly-logarithmic":[209],"locality.Our":[210],"constructions,":[211],"which":[212],"compare":[213],"favorably":[214],"analogs,":[218],"crucially":[219],"employ":[220],"functions":[223],"expander":[226],"graphs,":[227],"extending":[228],"ideas":[229],"from":[230],"memory-hard":[235],"functions.":[236]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}