{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:15:52Z","timestamp":1775016952200,"version":"3.50.1"},"reference-count":12,"publisher":"Pleiades Publishing Ltd","issue":"3","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Probl Inf Transm"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1134\/s0032946021030029","type":"journal-article","created":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T09:22:04Z","timestamp":1633598524000},"page":"212-240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Feedback Insertion-Deletion Codes"],"prefix":"10.1134","volume":"57","author":[{"given":"G.","family":"Maringer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. A.","family":"Polyanskii","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. V.","family":"Vorobyev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Welter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2021,10,7]]},"reference":[{"issue":"4","key":"5026_CR1","first-page":"845","volume":"163","author":"VI Levenshtein","year":"1965","unstructured":"Levenshtein, V.I., Binary Codes Capable of Correcting Deletions, Insertions, and Reversals, Dokl. Akad. Nauk SSSR, 1965, vol.\u00a0163, no.\u00a04, pp.\u00a0845\u2013848 [Soviet Physics Dokl. (Engl. Transl.), 1966, vol.\u00a010, no.\u00a08, pp.\u00a0707\u2013710]. http:\/\/mi.mathnet.ru\/eng\/dan31411","journal-title":"Dokl. Akad. Nauk SSSR,"},{"issue":"2","key":"5026_CR2","first-page":"288","volume":"26","author":"RR Varshamov","year":"1965","unstructured":"Varshamov, R.R. and Tenengol\u2019ts, G.M., A Code Which Corrects Single Asymmetric Errors, Avtomat. i Telemekh., 1965, vol.\u00a026, no.\u00a02, pp.\u00a0288\u2013292. http:\/\/mi.mathnet.ru\/eng\/at11293","journal-title":"Avtomat. i Telemekh.,"},{"issue":"6","key":"5026_CR3","doi-asserted-by":"publisher","first-page":"3207","DOI":"10.1109\/TIT.2020.2997329","volume":"67","author":"M Cheraghchi","year":"2020","unstructured":"Cheraghchi, M. and Ribeiro, J., An Overview of Capacity Results for Synchronization Channels, IEEE Trans. Inform. Theory, 2020, vol.\u00a067, no.\u00a06, pp.\u00a03207\u20133232. https:\/\/doi.org\/10.1109\/TIT.2020.2997329","journal-title":"IEEE Trans. Inform. Theory,"},{"issue":"7","key":"5026_CR4","doi-asserted-by":"publisher","first-page":"2552","DOI":"10.1109\/18.796406","volume":"45","author":"LJ Schulman","year":"1999","unstructured":"Schulman, L.J. and Zuckerman, D., Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions, IEEE Trans. Inform. Theory, 1999, vol.\u00a045, no.\u00a07, pp.\u00a02552\u20132557. https:\/\/doi.org\/10.1109\/18.796406","journal-title":"IEEE Trans. Inform. Theory,"},{"key":"5026_CR5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch133","volume-title":"An Improved Bound on the Fraction of Correctable Deletions","author":"B Bukh","year":"2016","unstructured":"Bukh, B. and Guruswami, V., An Improved Bound on the Fraction of Correctable Deletions, in Proc. 27th Annu. ACM\u2013SIAM Symp. on Discrete Algorithms (SODA\u20192016), Arlington, VA, USA, Jan. 10\u201312, 2016, pp.\u00a01893\u20131901. https:\/\/doi.org\/10.1137\/1.9781611974331.ch133"},{"issue":"1","key":"5026_CR6","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1109\/TIT.2016.2621044","volume":"63","author":"B Bukh","year":"2016","unstructured":"Bukh, B., Guruswami, V., and H\u00e5stad, J., An Improved Bound on the Fraction of Correctable Deletions, IEEE Trans. Inform. Theory, 2016, vol.\u00a063, no.\u00a01, pp.\u00a093\u2013103. https:\/\/doi.org\/10.1109\/TIT.2016.2621044","journal-title":"IEEE Trans. Inform. Theory,"},{"issue":"4","key":"5026_CR7","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1109\/TIT.1960.1057584","volume":"6","author":"M Plotkin","year":"1960","unstructured":"Plotkin, M., Binary Codes with Specified Minimum Distance, IRE Trans. Inform. Theory, 1960, vol.\u00a06, no.\u00a04, pp.\u00a0445\u2013450. https:\/\/doi.org\/10.1109\/TIT.1960.1057584","journal-title":"IRE Trans. Inform. Theory,"},{"key":"5026_CR8","volume-title":"Block Coding with Noiseless Feedback, PhD Thesis","author":"ER Berlekamp","year":"1964","unstructured":"Berlekamp, E.R., Block Coding with Noiseless Feedback, PhD Thesis, MIT, Cambridge, USA, 1964."},{"issue":"2","key":"5026_CR9","first-page":"3","volume":"12","author":"KSh Zigangirov","year":"1976","unstructured":"Zigangirov, K.Sh., On the Number of Correctable Errors for Transmission over a Binary Symmetrical Channel with Feedback, Probl. Peredachi Inf., 1976, vol.\u00a012, no.\u00a02, pp.\u00a03\u201319 [Probl. Inf. Transm. (Engl. Transl.), 1976, vol.\u00a012, no.\u00a02, pp.\u00a085\u201397]. http:\/\/mi.mathnet.ru\/eng\/ppi1683","journal-title":"Probl. Peredachi Inf.,"},{"issue":"3","key":"5026_CR10","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1109\/TIT.1963.1057832","volume":"9","author":"M Horstein","year":"1963","unstructured":"Horstein, M., Sequential Transmission Using Noiseless Feedback, IEEE Trans. Inform. Theory, 1963, vol.\u00a09, no.\u00a03, pp.\u00a0136\u2013143. https:\/\/doi.org\/10.1109\/TIT.1963.1057832","journal-title":"IEEE Trans. Inform. Theory,"},{"issue":"3","key":"5026_CR11","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1109\/TIT.1971.1054625","volume":"17","author":"J Schalkwijk","year":"1971","unstructured":"Schalkwijk, J., A Class of Simple and Optimal Strategies for Block Coding on the Binary Symmetric Channel with Noiseless Feedback, IEEE Trans. Inform. Theory, 1971, vol.\u00a017, no.\u00a03, pp.\u00a0283\u2013287. https:\/\/doi.org\/10.1109\/TIT.1971.1054625","journal-title":"IEEE Trans. Inform. Theory,"},{"issue":"2","key":"5026_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1134\/S0032946016020010","volume":"52","author":"VS Lebedev","year":"2016","unstructured":"Lebedev, V.S., Coding with Noiseless Feedback, Probl. Peredachi Inf., 2016, vol.\u00a052, no.\u00a02, pp.\u00a03\u201314 [Probl. Inf. Transm. (Engl. Transl.), 2016, vol.\u00a052, no.\u00a02, pp.\u00a0103\u2013113]. https:\/\/doi.org\/10.1134\/S0032946016020010","journal-title":"Probl. Peredachi Inf.,"}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946021030029.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946021030029","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946021030029.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:40:56Z","timestamp":1775011256000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946021030029"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["5026"],"URL":"https:\/\/doi.org\/10.1134\/s0032946021030029","relation":{"is-translation-of":[{"id-type":"doi","id":"10.31857\/S0555292321030025","asserted-by":"subject"}]},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7]]},"assertion":[{"value":"14 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}