{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:23:19Z","timestamp":1740122599246,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T00:00:00Z","timestamp":1645488000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T00:00:00Z","timestamp":1645488000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"KAKENHI","doi-asserted-by":"crossref","award":["18H01435"],"award-info":[{"award-number":["18H01435"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10623-021-01004-0","type":"journal-article","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T13:02:44Z","timestamp":1645534964000},"page":"2893-2922","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Decoding algorithms of monotone codes and azinv codes and their unified view"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0927-5273","authenticated-orcid":false,"given":"Hokuto","family":"Takahashi","sequence":"first","affiliation":[]},{"given":"Manabu","family":"Hagiwara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,22]]},"reference":[{"issue":"1","key":"1004_CR1","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1186\/1471-2105-14-272","volume":"14","author":"T Buschmann","year":"2013","unstructured":"Buschmann T., Bystrykh L.V.: Levenshtein error-correcting barcodes for multiplexed DNA sequencing. BMC Bioinform. 14(1), 272 (2013).","journal-title":"BMC Bioinform."},{"issue":"11","key":"1004_CR2","doi-asserted-by":"publisher","first-page":"7094","DOI":"10.1109\/TIT.2018.2807480","volume":"64","author":"YM Chee","year":"2018","unstructured":"Chee Y.M., Kiah H.M., Vardy A., Yaakobi E., et al.: Coding for racetrack memories. IEEE Trans. Inform. Theory 64(11), 7094\u20137112 (2018).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"1004_CR3","doi-asserted-by":"publisher","first-page":"2550","DOI":"10.1109\/TIT.2017.2778143","volume":"64","author":"R Gabrys","year":"2017","unstructured":"Gabrys R., Yaakobi E., Milenkovic O.: Codes in the Damerau distance for deletion and adjacent transposition correction. IEEE Trans. Inform. Theory 64(4), 2550\u20132570 (2017).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1004_CR4","doi-asserted-by":"crossref","unstructured":"Hagiwara M.: On ordered syndromes for multi insertion\/deletion error-correcting codes. In: 2016 IEEE international symposium on information theory (ISIT), pp. 625\u2013629. IEEE (2016)","DOI":"10.1109\/ISIT.2016.7541374"},{"key":"1004_CR5","doi-asserted-by":"crossref","unstructured":"Hagiwara M.: Perfect codes for single balanced adjacent deletions. In: 2017 IEEE international symposium on information theory (ISIT), pp. 1938\u20131942. IEEE (2017)","DOI":"10.1109\/ISIT.2017.8006867"},{"issue":"1","key":"1004_CR6","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/18.971760","volume":"48","author":"AS Helberg","year":"2002","unstructured":"Helberg A.S., Ferreira H.C.: On multiple insertion\/deletion correcting codes. IEEE Trans. Inform. Theory 48(1), 305\u2013308 (2002).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1004_CR7","doi-asserted-by":"crossref","unstructured":"Inoue M., Kaneko H.: Deletion\/insertion\/reversal error correcting codes for bit-patterned media recording. In: 2011 IEEE international symposium on defect and fault tolerance in VLSI and nanotechnology systems, pp. 286\u2013293. IEEE (2011)","DOI":"10.1109\/DFT.2011.36"},{"key":"1004_CR8","doi-asserted-by":"crossref","unstructured":"Krishnan A.R., Vasic B.: Coding for correcting insertions and deletions in bit-patterned media recording. In: 2011 IEEE global telecommunications conference-GLOBECOM 2011, pp. 1\u20135. IEEE (2011)","DOI":"10.1109\/GLOCOM.2011.6134512"},{"issue":"8","key":"1004_CR9","first-page":"707","volume":"10","author":"V Levenshtein","year":"1966","unstructured":"Levenshtein V.: Binary codes capable of correcting deletions, insertions, and reversals. Sov. Phys. Dokl. 10(8), 707\u2013710 (1966).","journal-title":"Sov. Phys. Dokl."},{"key":"1004_CR10","first-page":"293","volume":"19","author":"V Levenshtein","year":"1967","unstructured":"Levenshtein V.: Asymptotically optimum binary code with correction for losses of one or two adjacent bits. Problemy Kibernet 19, 293\u2013298 (1967).","journal-title":"Problemy Kibernet"},{"key":"1004_CR11","unstructured":"Nakada K.: A family of perfectness of the levenshtein codes l a (n; 2n). In: 2020 international symposium on information theory and its applications (ISITA), pp. 131\u2013135. IEEE (2020)"},{"key":"1004_CR12","doi-asserted-by":"crossref","unstructured":"Sima J., Bruck J.: Correcting deletions in multiple-heads racetrack memories. In: 2019 IEEE international symposium on information theory (ISIT), pp. 1367\u20131371. IEEE (2019)","DOI":"10.1109\/ISIT.2019.8849783"},{"key":"1004_CR13","doi-asserted-by":"crossref","unstructured":"Song W., Polyanskii N., Cai K., He X.: Systematic single-deletion multiple-substitution correcting codes. arXiv preprint arXiv:2006.11516 (2020)","DOI":"10.1109\/ISIT45174.2021.9517878"},{"key":"1004_CR14","doi-asserted-by":"publisher","unstructured":"Song W., Polyanskii N., Cai K., He X.: On multiple-deletion multiple-substitution correcting codes. In: 2021 IEEE international symposium on information theory (ISIT), pp. 2655\u20132660 (2021). https:\/\/doi.org\/10.1109\/ISIT45174.2021.9517878","DOI":"10.1109\/ISIT45174.2021.9517878"},{"key":"1004_CR15","unstructured":"Takahashi H., Hagiwara M.: On generalizations of Levenshtein\u2019s decoding algorithms (in japanese). In: Proceedings of SITA2019, pp. 13\u201318 (2019)"},{"key":"1004_CR16","unstructured":"Takahashi H., Hagiwara M.: Decoding algorithms of monotone codes and azinv codes and their unified view. In: 2020 international symposium on information theory and its applications (ISITA), pp. 284\u2013288. IEEE (2020)"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-01004-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-021-01004-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-01004-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,11]],"date-time":"2022-11-11T08:08:15Z","timestamp":1668154095000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-021-01004-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,22]]},"references-count":16,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["1004"],"URL":"https:\/\/doi.org\/10.1007\/s10623-021-01004-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,2,22]]},"assertion":[{"value":"28 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}