{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T04:19:46Z","timestamp":1741839586306,"version":"3.38.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6034261","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T17:24:20Z","timestamp":1317921860000},"page":"869-873","source":"Crossref","is-referenced-by-count":12,"title":["Constructions of rank modulation codes"],"prefix":"10.1109","author":[{"given":"Arya","family":"Mazumdar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Barg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Zemor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-010-2196-8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1023\/B:DESI.0000029212.52214.71"},{"journal-title":"Rank Correlation Methods","year":"1990","author":"kendall","key":"ref10"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.2517-6161.1977.tb01624.x","article-title":"Spearman's footrule as a measure of disarray","volume":"39","author":"diaconis","year":"1977","journal-title":"Journal of the Royal Statistical Society Series B"},{"key":"ref11","volume":"3","author":"knuth","year":"1973","journal-title":"The art of computer programming"},{"key":"ref5","first-page":"173","article-title":"Metrics on permutations, a survey","volume":"23","author":"deza","year":"1998","journal-title":"J Combin Inform System Sci"},{"journal-title":"Finite Fields","year":"1983","author":"lidl","key":"ref12"},{"key":"ref8","first-page":"1031","article-title":"Data movement in flash memories","author":"jiang","year":"2009","journal-title":"Proc 46th Annual Allerton Conf Commun Control Comput"},{"key":"ref7","first-page":"1736","article-title":"Error-correcting codes for rank modulation","author":"jiang","year":"2008","journal-title":"Proceedings of the IEEE International Symposium on Information Theory (ISIT)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054291"},{"key":"ref9","first-page":"1731","article-title":"Rank modulation for flash memories","author":"jiang","year":"2008","journal-title":"Proceedings of the IEEE International Symposium on Information Theory (ISIT)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048455"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06034261.pdf?arnumber=6034261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T14:49:49Z","timestamp":1741790989000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6034261\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6034261","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}