{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T10:03:12Z","timestamp":1725703392195},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620321","type":"proceedings-article","created":{"date-parts":[[2013,10,11]],"date-time":"2013-10-11T22:57:32Z","timestamp":1381532252000},"page":"724-728","source":"Crossref","is-referenced-by-count":14,"title":["Error-correcting codes for multipermutations"],"prefix":"10.1109","author":[{"given":"Sarit","family":"Buzaglo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tuvi","family":"Etzion","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jehoshua","family":"Bruck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/18.623158"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284106"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2005.1496578"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1965.3680"},{"key":"11","article-title":"Dynamic threshold schemes for multilevel non-volatile memories","author":"sala","year":"2012","journal-title":"Submitted to IEEE Transactions on Communications"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033927"},{"key":"3","article-title":"Rank-modulation rewriting codes for flash memories","author":"en gad","year":"2013","journal-title":"Submitted to Proc IEEE International Symp on Information Theory"},{"key":"2","first-page":"990","article-title":"Trade-offs between instantaneous and total capacity in multi-cell flash memories","author":"en gad","year":"2012","journal-title":"Proc IEEE International Symp on Information Theory"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048455"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ICTEL.2003.1191603"},{"journal-title":"Rank Correlation Methods","year":"1990","author":"kendall","key":"7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043764"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018336"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480194275692"},{"journal-title":"Non-asymptotic Upper Bounds for Deletion Correcting Codes","year":"2012","author":"kulkarni","key":"9"},{"journal-title":"The Art of Computer Programming Volume 3 Sorting and Searching","year":"1998","author":"knuth","key":"8"}],"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\/06620321.pdf?arnumber=6620321","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T17:08:49Z","timestamp":1490202529000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620321\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620321","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}