{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T22:19:30Z","timestamp":1771625970030,"version":"3.50.1"},"reference-count":78,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"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":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1109\/tit.2026.3656004","type":"journal-article","created":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T20:54:30Z","timestamp":1768856070000},"page":"1646-1653","source":"Crossref","is-referenced-by-count":0,"title":["Optimally Decoding 2-D Reed\u2013Solomon Codes Against Deletion Errors"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7684-6307","authenticated-orcid":false,"given":"Shubhransh","family":"Singhvi","sequence":"first","affiliation":[{"name":"International Institute of Information Technology, Hyderabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557110"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517842"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/s41587-019-0240-x"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT63088.2025.11195412"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3227128"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2011.060911.090145"},{"key":"ref7","volume-title":"Algebraic Coding Theory","author":"Berlekamp","year":"1968"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746566"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3148185"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3167662"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/21M142798X"},{"key":"ref12","article-title":"Linear insertion deletion codes in the high-noise and high-rate regimes","author":"Cheng","year":"2023","journal-title":"arXiv:2303.17370"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00028"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2997329"},{"key":"ref15","article-title":"Random Reed\u2013Solomon codes achieve the half-singleton bound for insertions and deletions over linear-sized alphabets","author":"Con","year":"2024","journal-title":"arXiv:2407.07299"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3173185"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3237711"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3387848"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3065618"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.892776"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2002.805269"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2019.2929408"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3202856"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876281"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3789-9_5"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2079016"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/0109020"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1002\/anie.201411378"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/18.782097"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384262"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3069446"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3056317"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849427"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2981321"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206888"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-45832-6"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3234967"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057714"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055516"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.819332"},{"issue":"8","key":"ref41","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":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/18.904499"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3081"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2600417"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.910595"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3398587"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2021.101841"},{"key":"ref48","article-title":"On list decoding of insertion and deletion errors","author":"Liu","year":"2019","journal-title":"arXiv:1906.09705"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054260"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2010.020110.00079"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1214\/08-PS141"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-022-30140-x"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1960.1057586"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btaa740"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-44993-5_6"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620761"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2552175"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661747"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028702"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3063709"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619163"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053661"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174213"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0439"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(75)90090-X"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3250459"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-020-15588-z"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2022.3215998"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-006-9032-7"},{"issue":"2","key":"ref72","first-page":"288","article-title":"A code for correcting a single asymmetric error","volume":"26","author":"Varshamov","year":"1965","journal-title":"Automatica i Telemekhanika"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2777471"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-024-01382-1"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-7865-4_24"},{"key":"ref76","article-title":"Error correction for algebraic block codes","author":"Welch"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2192435"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-05188-1"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11400648\/11358919.pdf?arnumber=11358919","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T21:16:38Z","timestamp":1771622198000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11358919\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":78,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2026.3656004","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]}}}