{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:58:46Z","timestamp":1773377926565,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174064","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"746-750","source":"Crossref","is-referenced-by-count":5,"title":["Codes Correcting Synchronization Errors for Symbol-Pair Read Channels"],"prefix":"10.1109","author":[{"given":"Yeow Meng","family":"Chee","sequence":"first","affiliation":[{"name":"National University of Singapore,Department of Industrial Systems Engineering and Management,Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Van Khu","family":"Vu","sequence":"additional","affiliation":[{"name":"National University of Singapore,Department of Industrial Systems Engineering and Management,Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2749469.2750388"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2807480"},{"key":"ref12","article-title":"Correcting two deletions and insertions in racetrack memory","author":"vahid","year":"2017"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437483"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849783"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849237"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746566"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849750"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007016"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/080730093"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2522434"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437501"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2937858"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2017.10.002"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488799"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1126\/science.1145799"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2726691"},{"key":"ref9","first-page":"23","article-title":"np-ECC: Non-adjacent position error correction code for racetrack memory","author":"wang","year":"2016","journal-title":"Proc IEEE\/ACM Int Symp Nanoscale Architectures"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2164891"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849470"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006867"},{"key":"ref21","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":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437868"},{"key":"ref23","first-page":"845","article-title":"Binary codes capable of correcting insertions, deletions and reversals","volume":"163","author":"levenshtein","year":"1965","journal-title":"Dokl Akad Nauk SSSR"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2778143"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876281"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174064.pdf?arnumber=9174064","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:35Z","timestamp":1773347735000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174064\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174064","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}