{"id":"https://openalex.org/W2744545650","doi":"https://doi.org/10.1109/isit.2017.8006869","title":"Limits to list decoding of insertions and deletions","display_name":"Limits to list decoding of insertions and deletions","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2744545650","doi":"https://doi.org/10.1109/isit.2017.8006869","mag":"2744545650"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006869","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006869","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 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=1355814","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041962883","display_name":"Antonia Wachter-Zeh","orcid":"https://orcid.org/0000-0002-5174-1947"},"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":"Antonia Wachter-Zeh","raw_affiliation_strings":["Institute for Communications Engineering, Technical University of Munich, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Institute for Communications Engineering, Technical University of Munich, Munich, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5041962883"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":0.3368,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.6038774,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1948","last_page":"1952"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9998999834060669,"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.9998999834060669,"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.9993000030517578,"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.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/levenshtein-distance","display_name":"Levenshtein distance","score":0.8668029308319092},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.8617217540740967},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.8263858556747437},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5546004772186279},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5477327108383179},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5446651577949524},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5329030156135559},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5032796263694763},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.4410783350467682},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4394301772117615},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43842169642448425},{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.41745632886886597},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37341293692588806},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3463734984397888},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.18287238478660583},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.1431795060634613}],"concepts":[{"id":"https://openalex.org/C2777515626","wikidata":"https://www.wikidata.org/wiki/Q496939","display_name":"Levenshtein distance","level":2,"score":0.8668029308319092},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.8617217540740967},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8263858556747437},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5546004772186279},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5477327108383179},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5446651577949524},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5329030156135559},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5032796263694763},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4410783350467682},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4394301772117615},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43842169642448425},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.41745632886886597},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37341293692588806},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3463734984397888},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.18287238478660583},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.1431795060634613},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2017.8006869","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006869","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:mediatum.ub.tum.de:node/1355814","is_oa":true,"landing_page_url":"http://mediatum.ub.tum.de/node?id=1355814","pdf_url":null,"source":{"id":"https://openalex.org/S4306400453","display_name":"mediaTUM \u2013 the media and publications repository of the Technical University Munich (Technical University 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"}],"best_oa_location":{"id":"pmh:oai:mediatum.ub.tum.de:node/1355814","is_oa":true,"landing_page_url":"http://mediatum.ub.tum.de/node?id=1355814","pdf_url":null,"source":{"id":"https://openalex.org/S4306400453","display_name":"mediaTUM \u2013 the media and publications repository of the Technical University Munich (Technical University 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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1504042137","https://openalex.org/W1580365030","https://openalex.org/W1647671624","https://openalex.org/W1969151232","https://openalex.org/W2034970974","https://openalex.org/W2081354249","https://openalex.org/W2086441968","https://openalex.org/W2109386785","https://openalex.org/W2142293082","https://openalex.org/W2509017166","https://openalex.org/W2511096347","https://openalex.org/W2557971396","https://openalex.org/W2584151571","https://openalex.org/W2895239415","https://openalex.org/W2963183421","https://openalex.org/W2963712885","https://openalex.org/W6676293227"],"related_works":["https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W2370284973","https://openalex.org/W2028976748","https://openalex.org/W2050784748","https://openalex.org/W2383267581","https://openalex.org/W2102627024","https://openalex.org/W2182594114","https://openalex.org/W2085052822","https://openalex.org/W2357077655"],"abstract_inverted_index":{"List":[0],"decoding":[1,25,61,75,96,103],"of":[2,43,48,76],"insertions":[3],"and":[4,39,52,99],"deletions":[5],"in":[6,26],"the":[7,20,27,37,44,46,49,53,64,80],"Levenshtein":[8,28,41,65],"metric":[9,29],"is":[10,30,67,85],"considered.":[11],"In":[12],"this":[13],"paper,":[14],"a":[15,91],"Johnson-like":[16],"upper":[17],"bound":[18,33,93],"on":[19,36,94],"maximum":[21],"list":[22,60,74,95,102],"size":[23],"when":[24],"derived.":[31],"This":[32],"depends":[34],"only":[35],"length":[38,47],"minimum":[40],"distance":[42,66],"code,":[45],"received":[50],"word,":[51],"alphabet":[54],"size.":[55],"It":[56],"shows":[57],"that":[58],"polynomial-time":[59],"beyond":[62],"half":[63],"possible":[68],"for":[69,105],"many":[70],"parameters.":[71],"For":[72],"example,":[73],"two":[77,106],"insertions/deletions":[78,107],"with":[79,108],"well-known":[81],"Varshamov-Tenengolts":[82],"(VT)":[83],"codes":[84,98],"feasible.":[86],"Further,":[87],"we":[88],"also":[89],"show":[90],"lower":[92],"VT":[97,109],"an":[100],"efficient":[101],"algorithm":[104],"codes.":[110]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}