{"id":"https://openalex.org/W2990860998","doi":"https://doi.org/10.1109/isit44484.2020.9174295","title":"Covering Codes for Insertions and Deletions","display_name":"Covering Codes for Insertions and Deletions","publication_year":2020,"publication_date":"2020-06-01","ids":{"openalex":"https://openalex.org/W2990860998","doi":"https://doi.org/10.1109/isit44484.2020.9174295","mag":"2990860998"},"language":"en","primary_location":{"id":"doi:10.1109/isit44484.2020.9174295","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit44484.2020.9174295","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://mediatum.ub.tum.de/node?id=1544292","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049949510","display_name":"Andreas Lenz","orcid":"https://orcid.org/0000-0002-0310-7706"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Andreas Lenz","raw_affiliation_strings":["Institute for Communications Engineering, Technical University of Munich,Germany","Institute for Communications Engineering, Technical University of Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Institute for Communications Engineering, Technical University of Munich,Germany","institution_ids":["https://openalex.org/I62916508"]},{"raw_affiliation_string":"Institute for Communications Engineering, Technical University of Munich, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066091408","display_name":"Cyrus Rashtchian","orcid":"https://orcid.org/0000-0001-9422-2779"},"institutions":[{"id":"https://openalex.org/I4210087596","display_name":"Qualcomm (United States)","ror":"https://ror.org/002zrf773","country_code":"US","type":"company","lineage":["https://openalex.org/I4210087596"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cyrus Rashtchian","raw_affiliation_strings":["University of California,Computer Science and Engineering Department and the Qualcomm Institute,San Diego"],"affiliations":[{"raw_affiliation_string":"University of California,Computer Science and Engineering Department and the Qualcomm Institute,San Diego","institution_ids":["https://openalex.org/I4210087596"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060049531","display_name":"Paul H. Siegel","orcid":"https://orcid.org/0000-0001-5850-0874"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Paul H. Siegel","raw_affiliation_strings":["CMRR, University of California,Department of Electrical and Computer Engineering,San Diego"],"affiliations":[{"raw_affiliation_string":"CMRR, University of California,Department of Electrical and Computer Engineering,San Diego","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021586372","display_name":"Eitan Yaakobi","orcid":"https://orcid.org/0000-0002-9851-5234"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Eitan Yaakobi","raw_affiliation_strings":["Technion – Israel Institute of Technology,Computer Science Department,Haifa,Israel","Technion - Israel Institute of Technology, Computer Science Department, Haifa Israel"],"affiliations":[{"raw_affiliation_string":"Technion – Israel Institute of Technology,Computer Science Department,Haifa,Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Technion - Israel Institute of Technology, Computer Science Department, Haifa Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5049949510"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00252705,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"26","issue":null,"first_page":"723","last_page":"728"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9995999932289124,"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/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9990000128746033,"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/T11130","display_name":"Coding theory and cryptography","score":0.9574999809265137,"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/hamming-distance","display_name":"Hamming distance","score":0.7024034261703491},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6948044300079346},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6593762636184692},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.5814200639724731},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5790517330169678},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.5472561120986938},{"id":"https://openalex.org/keywords/codebook","display_name":"Codebook","score":0.5237364768981934},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4940250515937805},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.45995083451271057},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.45225831866264343},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.45220351219177246},{"id":"https://openalex.org/keywords/hamming-space","display_name":"Hamming space","score":0.4362903833389282},{"id":"https://openalex.org/keywords/hamming-graph","display_name":"Hamming graph","score":0.4140337109565735},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3576163947582245},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2177003026008606},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1716577112674713},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.0886799693107605}],"concepts":[{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.7024034261703491},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6948044300079346},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6593762636184692},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.5814200639724731},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5790517330169678},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.5472561120986938},{"id":"https://openalex.org/C127759330","wikidata":"https://www.wikidata.org/wiki/Q637416","display_name":"Codebook","level":2,"score":0.5237364768981934},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4940250515937805},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.45995083451271057},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.45225831866264343},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.45220351219177246},{"id":"https://openalex.org/C2779494224","wikidata":"https://www.wikidata.org/wiki/Q5645799","display_name":"Hamming space","level":5,"score":0.4362903833389282},{"id":"https://openalex.org/C29696283","wikidata":"https://www.wikidata.org/wiki/Q369440","display_name":"Hamming graph","level":5,"score":0.4140337109565735},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3576163947582245},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2177003026008606},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1716577112674713},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0886799693107605},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"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":3,"locations":[{"id":"doi:10.1109/isit44484.2020.9174295","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit44484.2020.9174295","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:mediatum.ub.tum.de:node/1544292","is_oa":true,"landing_page_url":"http://mediatum.ub.tum.de/node?id=1544292","pdf_url":null,"source":{"id":"https://openalex.org/S4377196330","display_name":"mediaTUM  (Technical University of Munich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I62916508","host_organization_name":"Technical University of Munich","host_organization_lineage":["https://openalex.org/I62916508"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},{"id":"mag:3080657371","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:mediatum.ub.tum.de:node/1544292","is_oa":true,"landing_page_url":"http://mediatum.ub.tum.de/node?id=1544292","pdf_url":null,"source":{"id":"https://openalex.org/S4377196330","display_name":"mediaTUM  (Technical University of Munich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I62916508","host_organization_name":"Technical University of Munich","host_organization_lineage":["https://openalex.org/I62916508"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1969151232","https://openalex.org/W2001316732","https://openalex.org/W2048531498","https://openalex.org/W2081354249","https://openalex.org/W2107482120","https://openalex.org/W2125870772","https://openalex.org/W2169387919","https://openalex.org/W2170857855","https://openalex.org/W2788257106","https://openalex.org/W2895932209","https://openalex.org/W2898166636","https://openalex.org/W2963044831","https://openalex.org/W2963204642","https://openalex.org/W2964007110","https://openalex.org/W4213214442","https://openalex.org/W6636915900","https://openalex.org/W6713982304","https://openalex.org/W6768028469","https://openalex.org/W6769046962","https://openalex.org/W6770272811"],"related_works":["https://openalex.org/W3026400943","https://openalex.org/W3080657371","https://openalex.org/W2134722376","https://openalex.org/W3143455865","https://openalex.org/W2138182514","https://openalex.org/W2065447201","https://openalex.org/W3081225421","https://openalex.org/W2162765432","https://openalex.org/W2015465968","https://openalex.org/W2123912649","https://openalex.org/W2142103308","https://openalex.org/W2140050124","https://openalex.org/W1979807171","https://openalex.org/W2135527606","https://openalex.org/W2137806147","https://openalex.org/W1487897143","https://openalex.org/W2990083380","https://openalex.org/W2024095299","https://openalex.org/W2124272067","https://openalex.org/W2107482120"],"abstract_inverted_index":{"A":[0],"covering":[1,32,44,58,94,119,177],"code":[2,33],"is":[3,28,135],"a":[4,97,101,109,137],"set":[5],"of":[6,14,56,63,79,92],"codewords":[7,20],"with":[8,34,132],"the":[9,12,26,31,35,49,54,75,90,144,161,170],"property":[10],"that":[11,104,129,134],"union":[13],"balls,":[15],"suitably":[16],"defined,":[17],"around":[18],"these":[19],"covers":[21],"an":[22,157],"entire":[23],"space.":[24],"Generally,":[25],"goal":[27],"to":[29,108],"find":[30],"minimum":[36,76],"size":[37,78,91],"codebook.":[38],"While":[39],"most":[40],"prior":[41],"work":[42],"on":[43,48,74,89,160],"codes":[45,59,95,120,130],"has":[46],"focused":[47],"Hamming":[50,175],"metric,":[51],"we":[52,68,83,113,165],"consider":[53],"problem":[55],"designing":[57],"defined":[60],"in":[61],"terms":[62],"insertions":[64,124],"and":[65,164],"deletions.":[66,126],"First,":[67],"provide":[69,84],"new":[70,85],"sphere-covering":[71],"lower":[72,145],"bounds":[73,88,117,146,155,173],"possible":[77],"such":[80],"codes.":[81,178],"Then,":[82],"existential":[86],"upper":[87,116,154],"optimal":[93,158],"for":[96,118,147,174],"single":[98,102],"insertion":[99],"or":[100,125],"deletion":[103],"are":[105],"tight":[106],"up":[107],"constant":[110],"factor.":[111],"Finally,":[112],"derive":[114],"improved":[115],"using":[121],"R\u2265":[122],"2":[123],"We":[127],"prove":[128],"exist":[131],"density":[133,168],"only":[136],"factor":[138],"O(R":[139],"log":[140],"R)":[141],"larger":[142],"than":[143],"all":[148],"fixed":[149],"R.":[150],"In":[151],"particular,":[152],"our":[153],"have":[156],"dependence":[159],"word":[162],"length,":[163],"achieve":[166],"asymptotic":[167],"matching":[169],"best":[171],"known":[172],"distance":[176]},"counts_by_year":[],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}