{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T22:17:33Z","timestamp":1771366653490,"version":"3.50.1"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["ERC Advanced Grant 101054904 - TRANCIDS"],"award-info":[{"award-number":["ERC Advanced Grant 101054904 - TRANCIDS"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tcomm.2026.3655750","type":"journal-article","created":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T20:54:43Z","timestamp":1768856083000},"page":"4187-4202","source":"Crossref","is-referenced-by-count":1,"title":["Symbol-Level Deep Learning-Based Decoders for Concatenated Codes Over Insertion\/Deletion Channels"],"prefix":"10.1109","volume":"74","author":[{"given":"E. Uras","family":"Karg\u0131","sequence":"first","affiliation":[{"name":"Faculty of Electrical Engineering, Mathematics and Computer Science (EEMCS), Delft University of Technology (TU Delft), Delft, The Netherlands"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5187-8660","authenticated-orcid":false,"given":"Tolga M.","family":"Duman","sequence":"additional","affiliation":[{"name":"Department of Electrical and Electronics Engineering, Bilkent University, Ankara, Türkiye"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC51166.2024.10622561"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/20.560144"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1063\/1.2209179"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SiPS.2018.8598361"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.04.080683"},{"issue":"4","key":"ref7","first-page":"11","article-title":"Shannon\u2019s theorems for channels with synchronization errors","volume":"3","author":"Dobrushin","year":"1967","journal-title":"Problems Inf. Transmiss."},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046210"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.110310.090039"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2262019"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2009.5199553"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2368553"},{"issue":"2","key":"ref13","first-page":"286","article-title":"Codes which correct single asymmetric errors","volume":"26","author":"Varshamov","year":"1965","journal-title":"Autom. Remote Control"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.556130"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2002.1188355"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1049\/el:20020597"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.910582"},{"key":"ref18","first-page":"149","article-title":"Codes for channels with insertions, deletions and substitutions","volume-title":"Proc. 2nd Int. Symp. Turbo Codes Rel. Topics","author":"Ratzer"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2011.030411.100546"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.2020EAP1004"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1587\/comex.2022XBL0121"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E101.A.2055"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2017.7926071"},{"key":"ref24","article-title":"Communication algorithms via deep learning","author":"Kim","year":"2018","journal-title":"arXiv:1805.09317"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2019.8815400"},{"key":"ref26","first-page":"38695","article-title":"Error correction code transformer","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Choukroun"},{"key":"ref27","article-title":"Accelerating error correction code transformers","author":"Levy","year":"2024","journal-title":"arXiv:2410.05911"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3120274"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC51071.2022.9771578"},{"key":"ref30","first-page":"22115","article-title":"Boosting learning for LDPC codes to improve the error-floor performance","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Kwak"},{"key":"ref31","article-title":"CrossMPT: Cross-attention message-passing transformer for error correcting codes","author":"Park","year":"2024","journal-title":"arXiv:2405.01033"},{"key":"ref32","first-page":"2153","article-title":"A foundation model for error correction codes","volume-title":"Proc. Int. Conf. Represent. Learn.","volume":"2024","author":"Choukroun"},{"key":"ref33","first-page":"8801","article-title":"Learning linear block error correction codes","volume-title":"Proc. 41st Int. Conf. Mach. Learn.","volume":"235","author":"Choukroun"},{"key":"ref34","article-title":"Disturbance-based discretization, differentiable IDS channel, and an IDS-correcting code for DNA-based storage","author":"Guo","year":"2024","journal-title":"arXiv:2407.18929"},{"key":"ref35","article-title":"Sequential decoding for binary channels with noise and synchronization errors","author":"Gallager","year":"1961"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/78.650093"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1179"},{"key":"ref38","article-title":"On the difficulty of training recurrent neural networks","author":"Pascanu","year":"2012","journal-title":"arXiv:1211.5063"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/GCWkshps56602.2022.10008601"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3394039"},{"key":"ref41","article-title":"Coding for Insertion\/Deletion Channels","author":"Wang","year":"2012"},{"key":"ref42","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014","journal-title":"arXiv:1412.6980"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1908.01878"},{"key":"ref44","first-page":"448","article-title":"Batch normalization: Accelerating deep network training by reducing internal covariate shift","volume-title":"Proc. 32nd Int. Conf. Int. Conf. Mach. Learn. -, vol. 37","author":"Ioffe"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2007.898307"},{"key":"ref46","volume-title":"Encyclopedia of Sparse Graph Codes: Codes\/Data","author":"MacKay","year":"2025"},{"key":"ref47","volume-title":"Symbol-Level BIGRU Decoders for IDS Channels","author":"Karg\u0131","year":"2025"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/tcomm.2026.3655750"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT63088.2025.11195598"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/26\/11320979\/11358926.pdf?arnumber=11358926","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T21:07:29Z","timestamp":1771362449000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11358926\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/tcomm.2026.3655750","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}