{"id":"https://openalex.org/W4415367473","doi":"https://doi.org/10.1109/isit63088.2025.11195267","title":"Simple Converse Bounds on the Deletion Channel Capacity with Finite Block Lengths","display_name":"Simple Converse Bounds on the Deletion Channel Capacity with Finite Block Lengths","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415367473","doi":"https://doi.org/10.1109/isit63088.2025.11195267"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195267","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195267","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 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/A5042377784","display_name":"Ruslan Morozov","orcid":"https://orcid.org/0000-0003-0077-1246"},"institutions":[{"id":"https://openalex.org/I168864056","display_name":"Bilkent University","ror":"https://ror.org/02vh8a032","country_code":"TR","type":"education","lineage":["https://openalex.org/I168864056"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Ruslan Morozov","raw_affiliation_strings":["Bilkent University,Electrical and Electronics Engineering Department,Ankara,Turkey"],"affiliations":[{"raw_affiliation_string":"Bilkent University,Electrical and Electronics Engineering Department,Ankara,Turkey","institution_ids":["https://openalex.org/I168864056"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048023330","display_name":"Tolga M. Duman","orcid":"https://orcid.org/0000-0002-5187-8660"},"institutions":[{"id":"https://openalex.org/I168864056","display_name":"Bilkent University","ror":"https://ror.org/02vh8a032","country_code":"TR","type":"education","lineage":["https://openalex.org/I168864056"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Tolga M. Duman","raw_affiliation_strings":["Bilkent University,Electrical and Electronics Engineering Department,Ankara,Turkey"],"affiliations":[{"raw_affiliation_string":"Bilkent University,Electrical and Electronics Engineering Department,Ankara,Turkey","institution_ids":["https://openalex.org/I168864056"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042377784"],"corresponding_institution_ids":["https://openalex.org/I168864056"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.32896705,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.7669000029563904,"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"}},"topics":[{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.7669000029563904,"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/converse","display_name":"Converse","score":0.9054999947547913},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7448999881744385},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.5837000012397766},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5364999771118164},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5005000233650208},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.49410000443458557},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4867999851703644},{"id":"https://openalex.org/keywords/distribution","display_name":"Distribution (mathematics)","score":0.4320000112056732},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.39559999108314514}],"concepts":[{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.9054999947547913},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7448999881744385},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6901000142097473},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.5837000012397766},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5364999771118164},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5005000233650208},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.49410000443458557},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4867999851703644},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.4320000112056732},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4302000105381012},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4083000123500824},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.39559999108314514},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.387800008058548},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.36480000615119934},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.3637000024318695},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.33629998564720154},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.31119999289512634},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.3052000105381012},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.3043000102043152},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.30390000343322754},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.28459998965263367},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.27900001406669617},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.26019999384880066},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.2590999901294708},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.2563000023365021}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195267","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195267","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1992506348","https://openalex.org/W2020347709","https://openalex.org/W2025383314","https://openalex.org/W2106864314","https://openalex.org/W2109418578","https://openalex.org/W2117365084","https://openalex.org/W2140129757","https://openalex.org/W2162980030","https://openalex.org/W2346680365","https://openalex.org/W3012547567","https://openalex.org/W3093968171","https://openalex.org/W4285146809","https://openalex.org/W4398200026"],"related_works":[],"abstract_inverted_index":{"We":[0,56,83],"develop":[1],"the":[2,11,53,74,78,86,89,101,106,120],"first":[3],"non-asymptotic":[4],"upper":[5,103],"bound":[6,24,76,87,104,124],"on":[7,77,105],"code":[8,17,107],"size":[9],"for":[10,14,38,62,73,88,113,125],"deletion":[12,91],"channel":[13,67,92],"a":[15,28,31,48,58,63,70,94,114],"given":[16],"length":[18,97],"and":[19,43,68,98],"target":[20],"error":[21],"probability.":[22],"The":[23],"is":[25,41,109,119],"obtained":[26],"as":[27],"variation":[29],"of":[30],"general":[32,64],"converse":[33,75,123],"bound,":[34],"which,":[35],"though":[36],"available":[37],"any":[39],"channel,":[40,117],"inefficient":[42],"not":[44],"easily":[45],"computable":[46],"without":[47],"good":[49],"reference":[50,59],"distribution":[51,61],"over":[52],"output":[54,60],"alphabet.":[55],"obtain":[57],"finite-input":[65],"finite-output":[66],"provide":[69],"simple":[71],"formula":[72],"capacity":[79],"employing":[80],"this":[81,126],"distribution.":[82],"then":[84],"evaluate":[85],"binary":[90,115],"with":[93],"finite":[95],"block":[96],"show":[99],"that":[100,112],"resulting":[102],"side":[108],"tighter":[110],"than":[111],"erasure":[116],"which":[118],"only":[121],"alternative":[122],"finite-length":[127],"setting.":[128]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-21T00:00:00"}