{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:54:16Z","timestamp":1750312456432,"version":"3.37.3"},"reference-count":17,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"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":[[2023,7]]},"DOI":"10.1109\/tcomm.2023.3274157","type":"journal-article","created":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T18:45:11Z","timestamp":1683571511000},"page":"3807-3820","source":"Crossref","is-referenced-by-count":4,"title":["New Binary Code Design to Correct One Deletion and One Insertion Error"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8800-8511","authenticated-orcid":false,"given":"Thi-Huong","family":"Khuat","sequence":"first","affiliation":[{"name":"Department of Electrical, Electronic and Computer Engineering, University of Ulsan, Ulsan, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7854-7792","authenticated-orcid":false,"given":"Hosung","family":"Park","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, and the Department of ICT Convergence System Engineering, Chonnam National University, Gwangju, South Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1762-5915","authenticated-orcid":false,"given":"Sunghwan","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Electrical, Electronic and Computer Engineering, University of Ulsan, Ulsan, Republic of Korea"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056962"},{"issue":"3","key":"ref2","first-page":"288","article-title":"A code that corrects single asymmetric errors","volume":"161","author":"Varshamov","year":"1965","journal-title":"Automatika I Telemkhanika"},{"issue":"8","key":"ref3","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"Levenshtein","year":"1966","journal-title":"Sov. Phys.-Dokl."},{"key":"ref4","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":"ref5","first-page":"1246","article-title":"Codes for correcting three or more consecutive deletions or insertions","volume-title":"Proc. ISIT","author":"Cheng"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661747"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876281"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3069446"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028702"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173986"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746566"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.971760"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2174961"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2886354"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.05.398"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3036284"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2022.3146285"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/10184153\/10121430.pdf?arnumber=10121430","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T04:59:21Z","timestamp":1709269161000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10121430\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7]]},"references-count":17,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2023.3274157","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"type":"print","value":"0090-6778"},{"type":"electronic","value":"1558-0857"}],"subject":[],"published":{"date-parts":[[2023,7]]}}}