{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:31:11Z","timestamp":1761294671458,"version":"3.37.3"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,5,28]],"date-time":"2023-05-28T00:00:00Z","timestamp":1685232000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,28]],"date-time":"2023-05-28T00:00:00Z","timestamp":1685232000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-2212437"],"award-info":[{"award-number":["CCF-2212437"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,5,28]]},"DOI":"10.1109\/icc45041.2023.10279099","type":"proceedings-article","created":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T17:54:10Z","timestamp":1698083650000},"page":"5477-5482","source":"Crossref","is-referenced-by-count":6,"title":["Every Bit Counts: A New Version of Non-binary VT Codes with More Efficient Encoder"],"prefix":"10.1109","author":[{"given":"Tuan Thanh","family":"Nguyen","sequence":"first","affiliation":[{"name":"Singapore University of Technology and Design,Singapore,487372"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kui","family":"Cai","sequence":"additional","affiliation":[{"name":"Singapore University of Technology and Design,Singapore,487372"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul H.","family":"Siegel","sequence":"additional","affiliation":[{"name":"University of California, San Diego,La Jolla,CA,USA,92093"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056962"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.651063"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437715"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849643"},{"key":"ref20","first-page":"293","article-title":"Asymptotically optimum binary code with correction for losses of one or two adjacent bits","volume":"19","author":"levenshtein","year":"1967","journal-title":"Problemy Kibernetiki"},{"key":"ref11","first-page":"845","article-title":"Binary codes capable of correcting deletions, insertions and reversals","volume":"163","author":"levenshtein","year":"1965","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"ref10","article-title":"Codes which correct single asymmetric errors","volume":"26","author":"varshamov","year":"1965","journal-title":"Automatica i Telemekhanica"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517917"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LED.2016.2574916"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2010.2043926"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034886"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2788143"},{"key":"ref19","first-page":"8","article-title":"Binary codes capable of correcting spurious insertions and deletions of ones","volume":"1","author":"levenshtein","year":"1965","journal-title":"Prob Inf Trans"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517851"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3202856"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3049627"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3066430"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2002.1020232"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.892776"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-45832-6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"}],"event":{"name":"ICC 2023 - IEEE International Conference on Communications","start":{"date-parts":[[2023,5,28]]},"location":"Rome, Italy","end":{"date-parts":[[2023,6,1]]}},"container-title":["ICC 2023 - IEEE International Conference on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10278505\/10278554\/10279099.pdf?arnumber=10279099","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T19:00:36Z","timestamp":1699902036000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10279099\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,28]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/icc45041.2023.10279099","relation":{},"subject":[],"published":{"date-parts":[[2023,5,28]]}}}