{"id":"https://openalex.org/W2971175287","doi":"https://doi.org/10.1109/isit.2019.8849750","title":"Optimal k-Deletion Correcting Codes","display_name":"Optimal k-Deletion Correcting Codes","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2971175287","doi":"https://doi.org/10.1109/isit.2019.8849750","mag":"2971175287"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849750","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849750","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/A5051523017","display_name":"Jin Sima","orcid":"https://orcid.org/0000-0003-4588-9790"},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jin Sima","raw_affiliation_strings":["Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, 91125, USA","Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, 91125, USA","institution_ids":["https://openalex.org/I122411786"]},{"raw_affiliation_string":"Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, USA","institution_ids":["https://openalex.org/I122411786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043861677","display_name":"Jehoshua Bruck","orcid":"https://orcid.org/0000-0001-8474-0812"},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jehoshua Bruck","raw_affiliation_strings":["Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, 91125, USA","Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, 91125, USA","institution_ids":["https://openalex.org/I122411786"]},{"raw_affiliation_string":"Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, USA","institution_ids":["https://openalex.org/I122411786"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051523017"],"corresponding_institution_ids":["https://openalex.org/I122411786"],"apc_list":null,"apc_paid":null,"fwci":3.6932,"has_fulltext":false,"cited_by_count":52,"citation_normalized_percentile":{"value":0.94184989,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"847","last_page":"851"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":1.0,"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":1.0,"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.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/T11269","display_name":"Algorithms and Data Compression","score":0.9966999888420105,"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/redundancy","display_name":"Redundancy (engineering)","score":0.8147989511489868},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6558383703231812},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5442706346511841},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.527641236782074},{"id":"https://openalex.org/keywords/levenshtein-distance","display_name":"Levenshtein distance","score":0.5029992461204529},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42614176869392395},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3763312101364136},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3697381317615509},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35752809047698975},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32010501623153687}],"concepts":[{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.8147989511489868},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6558383703231812},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5442706346511841},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.527641236782074},{"id":"https://openalex.org/C2777515626","wikidata":"https://www.wikidata.org/wiki/Q496939","display_name":"Levenshtein distance","level":2,"score":0.5029992461204529},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42614176869392395},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3763312101364136},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3697381317615509},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35752809047698975},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32010501623153687},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2019.8849750","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849750","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"},{"id":"pmh:oai:authors.library.caltech.edu:102433","is_oa":false,"landing_page_url":"https://resolver.caltech.edu/CaltechAUTHORS:20200409-105733198","pdf_url":null,"source":{"id":"https://openalex.org/S4306402161","display_name":"CaltechAUTHORS (California Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122411786","host_organization_name":"California Institute of Technology","host_organization_lineage":["https://openalex.org/I122411786"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Report or Paper"},{"id":"pmh:oai:authors.library.caltech.edu:98251","is_oa":false,"landing_page_url":"https://authors.library.caltech.edu/98251/1/K_deletion_codes_Jin%20Sima.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306402161","display_name":"CaltechAUTHORS (California Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122411786","host_organization_name":"California Institute of Technology","host_organization_lineage":["https://openalex.org/I122411786"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Book Section"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1504042137","https://openalex.org/W1647671624","https://openalex.org/W1981176808","https://openalex.org/W2027333642","https://openalex.org/W2029448413","https://openalex.org/W2120978458","https://openalex.org/W2324882547","https://openalex.org/W2797057688","https://openalex.org/W2878242423","https://openalex.org/W2963044831","https://openalex.org/W2963210818","https://openalex.org/W2963733306","https://openalex.org/W2964230863","https://openalex.org/W2964262244","https://openalex.org/W6636915900","https://openalex.org/W6698193593","https://openalex.org/W6750027163"],"related_works":["https://openalex.org/W2575897682","https://openalex.org/W2081797125","https://openalex.org/W2996079066","https://openalex.org/W1967312449","https://openalex.org/W1986094003","https://openalex.org/W2096044998","https://openalex.org/W1424383737","https://openalex.org/W3092043337","https://openalex.org/W3086201193","https://openalex.org/W4299823210"],"abstract_inverted_index":{"Levenshtein":[0],"introduced":[1],"the":[2,13,32,37],"problem":[3,38],"of":[4,16,39,77],"constructing":[5,40],"k-deletion":[6,43,62],"correcting":[7,29,44,63],"codes":[8,18,45],"in":[9],"1966,":[10],"proved":[11],"that":[12,65],"optimal":[14,26,41],"redundancy":[15,27,42,67],"those":[17],"is":[19,51],"O(k":[20],"log":[21,69],"N),":[22],"and":[23,74],"proposed":[24],"an":[25],"single-deletion":[28],"code":[30,64],"(using":[31],"so-called":[33],"VT":[34],"construction).":[35],"However,":[36],"remained":[46],"open.":[47],"Our":[48],"key":[49],"contribution":[50],"a":[52,61],"solution":[53],"to":[54],"this":[55],"longstanding":[56],"open":[57],"problem.":[58],"We":[59],"present":[60],"has":[66],"8k":[68],"n":[70],"+":[71],"o(log":[72],"n)":[73],"encoding/decoding":[75],"algorithms":[76],"complexity":[78],"O(n":[79],"<sup":[80],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[81],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2k+1</sup>":[82],")":[83],"for":[84],"constant":[85],"k.":[86]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":16},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}