{"id":"https://openalex.org/W2992436002","doi":"https://doi.org/10.3390/e21121202","title":"Nonasymptotic Upper Bounds on Binary Single Deletion Codes via Mixed Integer Linear Programming","display_name":"Nonasymptotic Upper Bounds on Binary Single Deletion Codes via Mixed Integer Linear Programming","publication_year":2019,"publication_date":"2019-12-06","ids":{"openalex":"https://openalex.org/W2992436002","doi":"https://doi.org/10.3390/e21121202","mag":"2992436002"},"language":"en","primary_location":{"id":"doi:10.3390/e21121202","is_oa":true,"landing_page_url":"https://doi.org/10.3390/e21121202","pdf_url":"https://www.mdpi.com/1099-4300/21/12/1202/pdf?version=1576486626","source":{"id":"https://openalex.org/S195231649","display_name":"Entropy","issn_l":"1099-4300","issn":["1099-4300"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Entropy","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1099-4300/21/12/1202/pdf?version=1576486626","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049196468","display_name":"Albert No","orcid":"https://orcid.org/0000-0002-6346-4182"},"institutions":[{"id":"https://openalex.org/I94588446","display_name":"Hongik University","ror":"https://ror.org/00egdv862","country_code":"KR","type":"education","lineage":["https://openalex.org/I94588446"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Albert No","raw_affiliation_strings":["Department of Electronic and Electrical Engineering, Hongik University, Seoul 04066, Korea"],"raw_orcid":"https://orcid.org/0000-0002-6346-4182","affiliations":[{"raw_affiliation_string":"Department of Electronic and Electrical Engineering, Hongik University, Seoul 04066, Korea","institution_ids":["https://openalex.org/I94588446"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5049196468"],"corresponding_institution_ids":["https://openalex.org/I94588446"],"apc_list":{"value":2000,"currency":"CHF","value_usd":2227},"apc_paid":{"value":2000,"currency":"CHF","value_usd":2227},"fwci":0.2275,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.52450379,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"21","issue":"12","first_page":"1202","last_page":"1202"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9998000264167786,"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.9998000264167786,"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/T10621","display_name":"Gene Regulatory Network Analysis","score":0.9901000261306763,"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.9897000193595886,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.8081746101379395},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6681344509124756},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6234841346740723},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6190377473831177},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.6172614097595215},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.6011877655982971},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5851923823356628},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5660993456840515},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5599126219749451},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.5157501697540283},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5075176954269409},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4877096116542816},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4603358209133148},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.45566147565841675},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3299550712108612},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19849759340286255},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.10606279969215393},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.10090616345405579}],"concepts":[{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.8081746101379395},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6681344509124756},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6234841346740723},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6190377473831177},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6172614097595215},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6011877655982971},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5851923823356628},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5660993456840515},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5599126219749451},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.5157501697540283},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5075176954269409},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4877096116542816},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4603358209133148},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.45566147565841675},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3299550712108612},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19849759340286255},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.10606279969215393},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.10090616345405579},{"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/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.3390/e21121202","is_oa":true,"landing_page_url":"https://doi.org/10.3390/e21121202","pdf_url":"https://www.mdpi.com/1099-4300/21/12/1202/pdf?version=1576486626","source":{"id":"https://openalex.org/S195231649","display_name":"Entropy","issn_l":"1099-4300","issn":["1099-4300"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Entropy","raw_type":"journal-article"},{"id":"pmh:oai:mdpi.com:/1099-4300/21/12/1202/","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/e21121202","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Entropy","raw_type":"Text"},{"id":"pmh:oai:pubmedcentral.nih.gov:7514547","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/7514547","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Entropy (Basel)","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/e21121202","is_oa":true,"landing_page_url":"https://doi.org/10.3390/e21121202","pdf_url":"https://www.mdpi.com/1099-4300/21/12/1202/pdf?version=1576486626","source":{"id":"https://openalex.org/S195231649","display_name":"Entropy","issn_l":"1099-4300","issn":["1099-4300"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Entropy","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3190086665","display_name":null,"funder_award_id":"NRF-2017R1C1B5018298","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"},{"id":"https://openalex.org/G755373975","display_name":null,"funder_award_id":"SRFC-IT1802-","funder_id":"https://openalex.org/F4320332195","funder_display_name":"Samsung"},{"id":"https://openalex.org/G966427432","display_name":null,"funder_award_id":"SRFC-IT1802-09","funder_id":"https://openalex.org/F4320332195","funder_display_name":"Samsung"}],"funders":[{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"},{"id":"https://openalex.org/F4320332195","display_name":"Samsung","ror":"https://ror.org/04w3jy968"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2992436002.pdf","grobid_xml":"https://content.openalex.org/works/W2992436002.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W91900014","https://openalex.org/W1501400124","https://openalex.org/W1647671624","https://openalex.org/W1970898500","https://openalex.org/W1988303826","https://openalex.org/W2034381439","https://openalex.org/W2057568625","https://openalex.org/W2066635774","https://openalex.org/W2068617151","https://openalex.org/W2076511919","https://openalex.org/W2078289947","https://openalex.org/W2081354249","https://openalex.org/W2102799756","https://openalex.org/W2115151682","https://openalex.org/W2147414046","https://openalex.org/W2159427933","https://openalex.org/W2509017166","https://openalex.org/W2513955757","https://openalex.org/W2527757967","https://openalex.org/W2742021607","https://openalex.org/W2897671136","https://openalex.org/W2953230548","https://openalex.org/W2963183421","https://openalex.org/W2963869326","https://openalex.org/W2971175287","https://openalex.org/W2982206268","https://openalex.org/W3208721559","https://openalex.org/W6636915900","https://openalex.org/W6676293227","https://openalex.org/W6987305630"],"related_works":["https://openalex.org/W4252122881","https://openalex.org/W134055995","https://openalex.org/W2009796757","https://openalex.org/W4302819359","https://openalex.org/W1973873435","https://openalex.org/W4244487479","https://openalex.org/W1963627056","https://openalex.org/W2769220156","https://openalex.org/W1981191225","https://openalex.org/W2498361220"],"abstract_inverted_index":{"The":[0],"size":[1,45,72],"of":[2,43,46,73,95,120],"the":[3,44,71,85,92,96,106,121,137],"largest":[4],"binary":[5],"single":[6,27,47,74],"deletion":[7,28,48,75],"code":[8,23,29,49,76,111],"has":[9],"been":[10],"unknown":[11],"for":[12,30,52,114],"more":[13],"than":[14,79],"50":[15],"years.":[16],"It":[17],"is":[18,24,77,89,103,112],"known":[19],"that":[20,102,109,126,135],"Varshamov\u2013Tenengolts":[21],"(VT)":[22],"an":[25],"optimum":[26,113],"block":[31,86],"length":[32,87],"n":[33,88],"\u2264":[34],"10":[35],";":[36],"however,":[37],"only":[38],"a":[39,100],"few":[40],"upper":[41,58],"bounds":[42,59],"are":[50],"proposed":[51],"larger":[53],"n.":[54],"We":[55,131],"provide":[56,132],"improved":[57],"using":[60],"Mixed":[61],"Integer":[62],"Linear":[63],"Programming":[64],"(MILP)":[65],"relaxation":[66],"technique.":[67],"Especially,":[68],"we":[69,98],"show":[70],"smaller":[78],"or":[80],"equal":[81],"to":[82,105],"173":[83],"when":[84],"11.":[90],"In":[91],"second":[93],"half":[94],"paper,":[97],"propose":[99],"conjecture":[101,108,122],"equivalent":[104,118],"long-lasting":[107],"\u201cVT":[110],"all":[115],"n\u201d.":[116],"This":[117],"formulation":[119],"contains":[123],"small":[124],"sub-problems":[125],"can":[127],"be":[128],"numerically":[129],"verified.":[130],"numerical":[133],"results":[134],"support":[136],"conjecture.":[138]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}