{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T22:22:37Z","timestamp":1767910957656,"version":"3.49.0"},"reference-count":12,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[1969,1,1]],"date-time":"1969-01-01T00:00:00Z","timestamp":-31536000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1969,1,1]],"date-time":"1969-01-01T00:00:00Z","timestamp":-31536000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1969,1,1]],"date-time":"1969-01-01T00:00:00Z","timestamp":-31536000000},"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":[[1969,1]]},"DOI":"10.1109\/tit.1969.1054256","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T14:27:04Z","timestamp":1083076024000},"page":"102-106","source":"Crossref","is-referenced-by-count":27,"title":["A family of codes for the correction of substitution and synchronization errors"],"prefix":"10.1109","volume":"15","author":[{"given":"L.","family":"Calabi","sequence":"first","affiliation":[]},{"given":"W.","family":"Hartnett","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057684"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054343"},{"key":"ref10","author":"hatcher","year":"1968","journal-title":"The number of sequences in A for 0 ? C ? 13 0 ? n ? 13 and listings of selected A codes"},{"key":"ref6","first-page":"12","article-title":"Binary codes capable of correcting spurious insertions and deletions of ones","volume":"1","author":"levenshtein","year":"1965","journal-title":"Probl Peredachi Inform"},{"key":"ref11","first-page":"137","article-title":"Non-block error-correcting codes","volume":"12","year":"1964","journal-title":"Probl Kibernetiki"},{"key":"ref5","first-page":"845","article-title":"Binary codes with correction of deletions, insertions and substitution of symbols","volume":"163","author":"levenshtein","year":"1965","journal-title":"Dokl Akad Nauk SSSR"},{"key":"ref12","first-page":"858","article-title":"Certain properties of code systems","volume":"6","author":"levenshtein","year":"1962","journal-title":"Sov Phys ?Dokl"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1966.1053920"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IRET-SET.1962.5008817"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)91048-0"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1966.1053874"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053954"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22643\/01054256.pdf?arnumber=1054256","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T23:16:56Z","timestamp":1752103016000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1054256\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1969,1]]},"references-count":12,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.1969.1054256","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[1969,1]]}}}