{"id":"https://openalex.org/W2400161571","doi":"https://doi.org/10.1109/tit.2017.2746566","title":"Efficient Low-Redundancy Codes for Correcting Multiple Deletions","display_name":"Efficient Low-Redundancy Codes for Correcting Multiple Deletions","publication_year":2017,"publication_date":"2017-08-30","ids":{"openalex":"https://openalex.org/W2400161571","doi":"https://doi.org/10.1109/tit.2017.2746566","mag":"2400161571"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2017.2746566","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2017.2746566","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1507.06175","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028220417","display_name":"Joshua Brakensiek","orcid":"https://orcid.org/0000-0003-4149-7298"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joshua Brakensiek","raw_affiliation_strings":["Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA, USA","Department of Mathematical Sciences , Carnegie Mellon University , Pittsburgh , PA , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Department of Mathematical Sciences , Carnegie Mellon University , Pittsburgh , PA , USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068388812","display_name":"Venkatesan Guruswami","orcid":"https://orcid.org/0000-0001-7926-3396"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Venkatesan Guruswami","raw_affiliation_strings":["Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0000-0001-7926-3396","affiliations":[{"raw_affiliation_string":"Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041338991","display_name":"Samuel Zbarsky","orcid":"https://orcid.org/0000-0001-5820-2332"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]},{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Samuel Zbarsky","raw_affiliation_strings":["Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA, USA","Department of Mathematics, Princeton University, Princeton, NJ, USA","Department of Mathematical Sciences , Carnegie Mellon University , Pittsburgh , PA , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Department of Mathematics, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Department of Mathematical Sciences , Carnegie Mellon University , Pittsburgh , PA , USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00140491,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"64","issue":"5","first_page":"3403","last_page":"3410"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9994000196456909,"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.9994000196456909,"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.9980999827384949,"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.9761999845504761,"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.6522667407989502},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5962816476821899},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5919068455696106},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5467953681945801},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5205334424972534},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47567787766456604},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.47199562191963196},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46207574009895325},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.45775899291038513},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.43808338046073914},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.4246841073036194},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.4144923686981201},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36622291803359985},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.267516553401947},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.25456705689430237},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.1997547447681427},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.13414812088012695},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.11925679445266724}],"concepts":[{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.6522667407989502},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5962816476821899},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5919068455696106},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5467953681945801},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5205334424972534},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47567787766456604},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.47199562191963196},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46207574009895325},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.45775899291038513},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.43808338046073914},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.4246841073036194},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4144923686981201},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36622291803359985},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.267516553401947},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25456705689430237},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1997547447681427},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.13414812088012695},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.11925679445266724},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/tit.2017.2746566","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2017.2746566","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1507.06175","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1507.06175","pdf_url":"https://arxiv.org/pdf/1507.06175","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"doi:10.48550/arxiv.1507.06175","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1507.06175","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:2964262244","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1507.06175.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"mag:2400161571","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc22.html#BrakensiekGZ15","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1507.06175","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1507.06175","pdf_url":"https://arxiv.org/pdf/1507.06175","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1740449593","display_name":null,"funder_award_id":"CCF-1563742","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5200908636","display_name":"CIF/AF: Small: Some fundamental complexity-inspired coding theory challenges","funder_award_id":"1422045","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5735448797","display_name":"AF:  Medium:  New Directions in Coding Theory and Pseudorandomness","funder_award_id":"0963975","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8564812914","display_name":null,"funder_award_id":"CCF-0963975","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8660029734","display_name":null,"funder_award_id":"CCF-1422045","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2400161571.pdf","grobid_xml":"https://content.openalex.org/works/W2400161571.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1504042137","https://openalex.org/W1981176808","https://openalex.org/W1991454799","https://openalex.org/W2027333642","https://openalex.org/W2029448413","https://openalex.org/W2044492449","https://openalex.org/W2054076994","https://openalex.org/W2102799756","https://openalex.org/W2108572348","https://openalex.org/W2120978458","https://openalex.org/W2416529140","https://openalex.org/W2963044831","https://openalex.org/W2964011803","https://openalex.org/W6605269843","https://openalex.org/W6625454320","https://openalex.org/W6636915900","https://openalex.org/W6681625143"],"related_works":["https://openalex.org/W1504042137","https://openalex.org/W2982206268","https://openalex.org/W2797057688","https://openalex.org/W2276052641","https://openalex.org/W2967080394","https://openalex.org/W3035808655","https://openalex.org/W2952657341","https://openalex.org/W3179915974","https://openalex.org/W3198439812","https://openalex.org/W2397681459","https://openalex.org/W2887892895","https://openalex.org/W2949721645","https://openalex.org/W2761730204","https://openalex.org/W2582381331","https://openalex.org/W2131216180","https://openalex.org/W3022998358","https://openalex.org/W2952017698","https://openalex.org/W2146820445","https://openalex.org/W1990567794","https://openalex.org/W2882276274"],"abstract_inverted_index":{"We":[0,117,137],"consider":[1],"the":[2,28,56,111,149,157],"problem":[3],"of":[4,42,51,58,115,130,145],"constructing":[5],"binary":[6,79],"codes":[7,143],"to":[8,101,121,125,132],"recover":[9],"from":[10,31,89],"k-bit":[11],"deletions":[12,91],"with":[13,27,38,67,81],"efficient":[14],"encoding/decoding,":[15],"for":[16,55,127],"a":[17,78,128],"fixed":[18,74],"k.":[19],"The":[20,96],"single":[21],"deletion":[22],"case":[23,57],"is":[24,106,155],"well":[25],"understood,":[26],"Varshamov-Tenengolts-Levenshtein":[29],"code":[30,80,124,154],"1965":[32],"giving":[33],"an":[34],"asymptotically":[35],"optimal":[36],"construction":[37,66],"\u2248":[39],"2n/n":[40],"codewords":[41],"length":[43],"n,":[44],"i.e.,":[45],"at":[46],"most":[47],"log":[48],"n":[49,83],"bits":[50],"redundancy.":[52],"However,":[53],"even":[54],"two":[59],"deletions,":[60,148],"there":[61],"was":[62],"no":[63],"known":[64],"explicit":[65],"redundancy":[68,84],"less":[69],"than":[70,110],"n\u03a9(1).":[71],"For":[72],"any":[73],"k,":[75],"we":[76],"construct":[77],"cklog":[82],"that":[85,140],"can":[86],"be":[87,99,102],"decoded":[88],"k":[90,133,147],"in":[92],"Ok(n":[93],"log4n)":[94],"time.":[95],"coefficient":[97],"ckcan":[98],"taken":[100],"O(k2log":[103],"k),":[104],"which":[105],"only":[107],"quadratically":[108],"worse":[109],"optimal,":[112],"non-constructive":[113],"bound":[114],"O(k).":[116],"also":[118,138],"indicate":[119],"how":[120],"modify":[122],"this":[123],"allow":[126],"combination":[129],"up":[131],"insertions":[134],"and":[135],"deletions.":[136],"note":[139],"among":[141],"linear":[142],"capable":[144],"correcting":[146],"(k":[150],"+":[151],"1)-fold":[152],"repetition":[153],"essentially":[156],"best":[158],"possible.":[159]},"counts_by_year":[],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}