{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:40:04Z","timestamp":1773376804533,"version":"3.50.1"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"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":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206675","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"2708-2713","source":"Crossref","is-referenced-by-count":5,"title":["Codes Correcting a Single Long Duplication Error"],"prefix":"10.1109","author":[{"given":"Daniil","family":"Goshkoder","sequence":"first","affiliation":[{"name":"Skolkovo Institute of Science and Technology,Moscow,Russia"}]},{"given":"Nikita","family":"Polyanskii","sequence":"additional","affiliation":[{"name":"IOTA Foundation,Berlin,Germany"}]},{"given":"Ilya","family":"Vorobyev","sequence":"additional","affiliation":[{"name":"Technical University of Munich,Munich,Germany"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3059095"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3006228"},{"key":"ref15","article-title":"Bounds and constructions for multi-symbol duplication error correcting codes","author":"lenz","year":"2018"},{"key":"ref14","article-title":"Bounds on codes correcting tandem and palindromic duplications","author":"lenz","year":"2017"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0523-0"},{"key":"ref10","first-page":"4","article-title":"Introduction to coding theory","volume":"47","author":"roth","year":"2006","journal-title":"IET Communications"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2872362.2872397"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/s41576-019-0125-3"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2940256"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2868666"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007104"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.10.003"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2778143"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661747"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518196"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174288"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2688361"},{"key":"ref22","first-page":"299","article-title":"Codes correcting bounded length tandem duplication","author":"nazirkhanova","year":"2020","journal-title":"2020 International Symposium on Information Theory and Its Applications (ISITA)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2018.6053"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3092056"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206675"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814634"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028702"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.971760"},{"key":"ref9","volume":"16","author":"macwilliams","year":"1977","journal-title":"The Theory of Error Correcting Codes"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00239-004-2619-6"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1126\/science.1226355"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746566"},{"key":"ref5","first-page":"8","article-title":"Binary codes capable of correcting spurious insertions and deletion of ones","volume":"1","author":"levenshtein","year":"1965","journal-title":"Problems of Information Transmission"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206675.pdf?arnumber=10206675","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:26Z","timestamp":1773347306000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206675\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206675","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}