{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T17:30:00Z","timestamp":1729618200100,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006602","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T18:54:37Z","timestamp":1504032877000},"page":"619-623","source":"Crossref","is-referenced-by-count":10,"title":["Coding for racetrack memories"],"prefix":"10.1109","author":[{"given":"Yeow Meng","family":"Chee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han Mao","family":"Kiah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Vardy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Van Khu","family":"Vu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.2307\/2686886"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.4169\/math.mag.85.2.141"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661747"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488799"},{"key":"ref14","first-page":"288","article-title":"Codes which correct single asymmetric errors (in Russian)","volume":"161","author":"varshamov","year":"1965","journal-title":"Automatika i Telemekhanika"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2333660.2333707"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2749469.2750388"},{"journal-title":"Duplication-correcting codes for data storage in the DNA of living organisms","year":"2016","author":"jain","key":"ref4"},{"journal-title":"Codes for Mass Data Storage Systems","year":"2004","author":"immink","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.904499"},{"key":"ref5","first-page":"845","article-title":"Binary codes capable of correcting insertions, deletions and reversals","volume":"163","author":"levenshtein","year":"1965","journal-title":"Dokl Akad Nauk SSSR"},{"key":"ref8","article-title":"Nearly optimal sticky-insertion correcting codes with efficient encoding and decoding","author":"mahdavifar","year":"2017","journal-title":"Proc IEEE Int Symp on Inform Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007103"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/080730093"},{"journal-title":"Efficient low-redundancy codes for correcting multiple deletions","year":"2015","author":"brakensiek","key":"ref1"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1126\/science.1145799","article-title":"Magnetic domain-wall racetrack memory","volume":"320","author":"parkin","year":"2008","journal-title":"Science"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006602.pdf?arnumber=8006602","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T22:20:05Z","timestamp":1570054805000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006602\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006602","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}