{"id":"https://openalex.org/W4415343805","doi":"https://doi.org/10.4230/lipics.itc.2025.1","title":"Amortized Locally Decodable Codes for Insertions and Deletions","display_name":"Amortized Locally Decodable Codes for Insertions and Deletions","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4415343805","doi":"https://doi.org/10.4230/lipics.itc.2025.1"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2507.03141","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.03141","pdf_url":"https://arxiv.org/pdf/2507.03141","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2507.03141","any_repository_has_fulltext":true},"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":"Blocki, Jeremiah","raw_affiliation_strings":["Department of Computer Science, Purdue University, West Lafayette, IN, USA"],"raw_orcid":"https://orcid.org/0000-0002-5542-4674","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":null,"display_name":"Zhang, Justin","orcid":"https://orcid.org/0009-0006-4976-0803"},"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":"Zhang, Justin","raw_affiliation_strings":["Department of Computer Science, Purdue University, West Lafayette, IN, USA"],"raw_orcid":"https://orcid.org/0009-0006-4976-0803","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028278191"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14936867,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"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.9909999966621399,"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.9909999966621399,"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/T12162","display_name":"Cellular Automata and Applications","score":0.972599983215332,"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/T12029","display_name":"DNA and Biological Computing","score":0.9514999985694885,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.7735000252723694},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.6291999816894531},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.6067000031471252},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5493999719619751},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.47769999504089355},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.4009000062942505},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.38359999656677246}],"concepts":[{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.7735000252723694},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.664900004863739},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.6291999816894531},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.6067000031471252},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5493999719619751},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5027999877929688},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48410001397132874},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.47769999504089355},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.4009000062942505},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.38359999656677246},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.3677999973297119},{"id":"https://openalex.org/C112932734","wikidata":"https://www.wikidata.org/wiki/Q2322550","display_name":"Hamming(7,4)","level":5,"score":0.31690001487731934},{"id":"https://openalex.org/C29696283","wikidata":"https://www.wikidata.org/wiki/Q369440","display_name":"Hamming graph","level":5,"score":0.29670000076293945},{"id":"https://openalex.org/C2776639384","wikidata":"https://www.wikidata.org/wiki/Q840396","display_name":"Ideal (ethics)","level":2,"score":0.2888999879360199},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27459999918937683},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26899999380111694},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.2630999982357025},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.25110000371932983}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2507.03141","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.03141","pdf_url":"https://arxiv.org/pdf/2507.03141","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.4230/lipics.itc.2025.1","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.itc.2025.1","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:arXiv.org:2507.03141","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.03141","pdf_url":"https://arxiv.org/pdf/2507.03141","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Locally":[0,67],"Decodable":[1,68],"Codes":[2,69],"(LDCs)":[3],"are":[4,38,142],"error":[5,36,106,169,208,296],"correcting":[6],"codes":[7],"which":[8,71,141,185,252,309],"permit":[9],"the":[10,24,32,45,51,62,73,83,132,206,238,261,265,271],"recovery":[11,84],"of":[12,21,64,80,85,89,216,246,304],"any":[13,187],"single":[14],"message":[15,90],"symbol":[16],"with":[17,165,288],"a":[18,86,182,193,244,311],"low":[19],"number":[20,79],"queries":[22,81],"to":[23,76,135,144,151,180,199],"codeword":[25],"(the":[26],"locality).":[27],"Traditional":[28],"LDC":[29,164,190,202,251],"tradeoffs":[30],"between":[31,314],"rate,":[33,100,207],"locality,":[34,103,291],"and":[35,59,94,104,112,121,168,210,218,221,285,294,316],"tolerance":[37,170,209],"undesirable":[39,234],"even":[40,153,172],"in":[41,110,173,237,260,283,302],"relaxed":[42,174,262],"settings":[43,263,287],"where":[44,50,264,270],"encoder/decoder":[46],"share":[47,267],"randomness":[48,268],"or":[49,269],"channel":[52,272],"is":[53,128,149,179,243,273,300],"resource-bounded.":[54],"Recent":[55],"work":[56],"by":[57],"Blocki":[58,93],"Zhang":[60,95],"initiated":[61],"study":[63],"Hamming":[65,108,125,189,229,250],"amortized":[66,102,188,200,211,249,290,317],"(aLDCs),":[70],"allow":[72],"local":[74],"decoder":[75],"amortize":[77],"their":[78],"over":[82],"small":[87],"subset":[88],"symbols.":[91],"Surprisingly,":[92],"construct":[96],"asymptotically":[97,204],"ideal":[98,248,280],"(constant":[99],"constant":[101,105,166,289,292,295],"tolerance)":[107],"aLDCs":[109,282],"private-key":[111,284],"resource-bounded":[113,286],"settings.":[114,175],"While":[115],"this":[116],"result":[117,299,308],"overcame":[118],"previous":[119],"barriers":[120],"impossibility":[122,307],"results":[123],"for":[124,227,319],"LDCs,":[126,230],"it":[127],"not":[129],"clear":[130],"whether":[131],"techniques":[133],"extend":[134],"Insdel":[136,139,163,201,281,320],"LDCs.":[137,321],"Constructing":[138],"LDCs":[140],"resilient":[143],"insertion":[145],"and/or":[146],"deletion":[147],"errors":[148],"known":[150],"be":[152],"more":[154],"challenging.":[155],"For":[156],"example,":[157],"Gupta":[158],"(STOC'24)":[159,306],"proved":[160],"that":[161,191],"no":[162],"rate":[167,293],"exists":[171],"Our":[176,240],"first":[177],"contribution":[178,242],"provide":[181],"Hamming-to-Insdel":[183,214],"compiler":[184],"transforms":[186],"satisfies":[192,253],"particular":[194],"property":[195,256],"(consecutive":[196,257],"interval":[197,258],"querying)":[198,259],"while":[203],"preserving":[205],"locality.":[212,239],"Prior":[213],"compilers":[215],"Ostrovsky":[217],"Paskin-Cherniavsky":[219],"(ICITS'15)":[220],"Block":[222],"et":[223],"al.":[224],"(FSTTCS'20)":[225],"worked":[226],"arbitrary":[228],"but":[231],"incurred":[232],"an":[233,247],"polylogarithmic":[235],"blow-up":[236],"second":[241],"construction":[245],"our":[254],"special":[255],"sender/receiver":[266],"resource":[274],"bounded.":[275],"Taken":[276],"together,":[277],"we":[278],"obtain":[279],"tolerance.":[297],"This":[298],"surprising":[301],"light":[303],"Gupta\u2019s":[305],"demonstrates":[310],"strong":[312],"separation":[313],"locality":[315,318]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-20T00:00:00"}