{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T00:31:20Z","timestamp":1780705880877,"version":"3.54.1"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/tit.2009.2018336","type":"journal-article","created":{"date-parts":[[2009,5,19]],"date-time":"2009-05-19T21:01:44Z","timestamp":1242766904000},"page":"2659-2673","source":"Crossref","is-referenced-by-count":216,"title":["Rank Modulation for Flash Memories"],"prefix":"10.1109","volume":"55","author":[{"family":"Anxiao Jiang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R.","family":"Mateescu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Schwartz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.","family":"Bruck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144595295272"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(82)90344-8"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/4.841491"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00141-7"},{"key":"ref37","article-title":"buffer codes for multi-level flash memory","author":"yaakobi","year":"2008","journal-title":"Poster Session of the IEEE Int Symp Information Theory"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1002\/j.1538-7305.1984.tb00115.x","article-title":"coding for a write-once memory","volume":"63","author":"wolf","year":"1984","journal-title":"AT&T Bell Labs Tech J"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1965.3680"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/356689.356692"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056918"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.746827"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.705558"},{"key":"ref13","year":"1953","journal-title":"Pulse code communication"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2003.811714"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.2307\/2313307"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.340461"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1056994"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056723"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75520-3_18"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557384"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1090\/psapm\/010\/0113289","article-title":"teaching combinatorial tricks to a computer","volume":"10","author":"lehmer","year":"1960","journal-title":"Proc Symp Applied Mathematics and Combinatorial Analysis"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054729"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057221"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056818"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5015-0"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5015-0_3"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-51542-9_5"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2005.1465045"},{"key":"ref9","author":"etzion","year":"2007"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.915696"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/0137008"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557381"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557417"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595285"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595286"},{"key":"ref26","first-page":"176","article-title":"sur la numration factorielle, application aux permutations","volume":"16","author":"laisant","year":"0","journal-title":"Bull Socit Mathmatique de France"},{"key":"ref25","author":"knuth","year":"1998","journal-title":"The Art of Computer Programming Volume 3 Sorting and Searching"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/4957623\/04957650.pdf?arnumber=4957650","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:03:29Z","timestamp":1633910609000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4957650\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":37,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2009.2018336","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6]]}}}