{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:42:21Z","timestamp":1773376941947,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"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":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195329","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["On the Capacity of Insertion Channels for Small Insertion Probabilities"],"prefix":"10.1109","author":[{"given":"Busra","family":"Tegin","sequence":"first","affiliation":[{"name":"Bilkent University,Department of Electrical and Electronics Engineering,Ankara,Turkey"}]},{"given":"Tolga M.","family":"Duman","sequence":"additional","affiliation":[{"name":"Bilkent University,Department of Electrical and Electronics Engineering,Ankara,Turkey"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849647"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1117\/12.838537"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-45832-6"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2961265"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICCNC.2014.6785330"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.904499"},{"issue":"4","key":"ref7","first-page":"18","article-title":"Shannon\u2019s theorems for channels with synchronization errors","volume":"3","author":"Dobrushin","year":"1967","journal-title":"Probl. Peredachi Inf."},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619598"},{"key":"ref10","article-title":"Shannon capacity of channels with Markov insertions, deletions and substitutions","author":"Morozov","year":"2024","journal-title":"arXiv preprint"},{"key":"ref11","volume-title":"Sequential Decoding for Binary Channels with Noise and Synchronization Errors","author":"Gallager","year":"2000"},{"issue":"2","key":"ref12","first-page":"23","article-title":"Sequential decoding for a binary channel with dropouts and insertions","volume":"5","author":"Zigangirov","year":"1969","journal-title":"Probl. Peredachi Inf."},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881844"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034883"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557469"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046210"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620764"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.110310.090039"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3281275"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2997329"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513746"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513745"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2262020"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.020413.120070"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911291"},{"key":"ref26","article-title":"Capacity approximations for insertion channels with small insertion probabilities","author":"Tegin","year":"2024","journal-title":"arXiv preprint"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195329.pdf?arnumber=11195329","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:28Z","timestamp":1773347368000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195329\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195329","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}