{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T04:02:56Z","timestamp":1747540976648,"version":"3.40.5"},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003725","name":"Research Program through the National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2022M3C1A3081366","NRF-2023R1A2C1003546"],"award-info":[{"award-number":["NRF-2022M3C1A3081366","NRF-2023R1A2C1003546"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1109\/tcomm.2024.3487052","type":"journal-article","created":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T17:34:21Z","timestamp":1730136861000},"page":"2891-2905","source":"Crossref","is-referenced-by-count":0,"title":["Design of Codes for One Insertion and at Most Two Consecutive Deletion Errors"],"prefix":"10.1109","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8800-8511","authenticated-orcid":false,"given":"Thi-Huong","family":"Khuat","sequence":"first","affiliation":[{"name":"Telecommunications Faculty 1, Posts and Telecommunications Institute of Technology, Hanoi, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1762-5915","authenticated-orcid":false,"given":"Sunghwan","family":"Kim","sequence":"additional","affiliation":[{"name":"School of Electronic Engineering, Kyonggi University, Suwon-si, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1214\/08-PS141"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/SURV.2010.020110.00079"},{"year":"2007","author":"Dandashi","article-title":"Tactical edge characterization framework","key":"ref3"},{"issue":"3","key":"ref4","first-page":"288","article-title":"A code that corrects single asymmetric errors","volume":"161","author":"Varshamov","year":"1965","journal-title":"Automatika I Telemkhanika"},{"key":"ref5","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"Levenshtein","year":"1966","journal-title":"Sov. Phys. Doklady"},{"key":"ref6","first-page":"298","article-title":"Asymptotically optimum binary codes with correction for losses of one or two adjacent bits","volume":"19","author":"Levenshtein","year":"1970","journal-title":"Syst. Theory Res."},{"key":"ref7","first-page":"1246","article-title":"Codes for correcting three or more consecutive deletions or insertions","volume-title":"Proc. ISIT","author":"Cheng"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TIT.2017.2661747"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/TIT.2017.2746566"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/ISIT44484.2020.9174288"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/18.971760"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/TIT.2011.2174961"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/TCOMM.2018.2886354"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/TIT.2021.3069446"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/TIT.2023.3319088"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/ISIT45174.2021.9517878"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/tit.2025.3531915"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/TCOMM.2023.3274157"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1016\/j.procs.2016.05.398"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/TIT.2020.3036284"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/TCOMM.2022.3146285"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/26\/11006303\/10736671.pdf?arnumber=10736671","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T04:57:42Z","timestamp":1747457862000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10736671\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5]]},"references-count":21,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2024.3487052","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"type":"print","value":"0090-6778"},{"type":"electronic","value":"1558-0857"}],"subject":[],"published":{"date-parts":[[2025,5]]}}}