{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:52:09Z","timestamp":1730274729994,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620316","type":"proceedings-article","created":{"date-parts":[[2013,10,12]],"date-time":"2013-10-12T02:57:32Z","timestamp":1381546652000},"page":"699-703","source":"Crossref","is-referenced-by-count":5,"title":["An improvement to Levenshtein's upper bound on the cardinality of deletion correcting codes"],"prefix":"10.1109","author":[{"given":"Daniel","family":"Cullina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Negar","family":"Kiyavash","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","first-page":"288292","article-title":"Codes which correct single asymmetric errors","volume":"26","author":"varshamov","year":"1965","journal-title":"Avtomatika i Telemekhanika"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056962"},{"key":"12","first-page":"540543","article-title":"On an arithmetic function with an application in the theory of coding","volume":"161","author":"varshamov","year":"1965","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"3","first-page":"115122","article-title":"Bounds on the number of string subsequences","author":"hirschberg","year":"1999","journal-title":"Combinatorial Pattern Matching"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284242"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(69)90442-2"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.806155"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023642"},{"key":"6","first-page":"207305","article-title":"Elements of coding theory","author":"levenshtein","year":"1974","journal-title":"Diskretnaya Matematika i Matematicheskie Voprosy Kibernetiki"},{"key":"5","first-page":"707710","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"levenshtein","year":"1966","journal-title":"Soviet Physics Doklady"},{"key":"4","article-title":"Non-asymptotic upper bounds for deletion correcting codes","author":"kulkarni","year":"2012","journal-title":"IEEE Transactions on Information Theory"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924730"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284240"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2013,7,7]]},"location":"Istanbul, Turkey","end":{"date-parts":[[2013,7,12]]}},"container-title":["2013 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6597029\/6620166\/06620316.pdf?arnumber=6620316","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T03:20:21Z","timestamp":1490239221000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620316\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620316","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}