{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T16:08:36Z","timestamp":1787760516764,"version":"build-2784847793"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2010,5,1]],"date-time":"2010-05-01T00:00:00Z","timestamp":1272672000000},"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":[[2010,5]]},"DOI":"10.1109\/tit.2010.2043764","type":"journal-article","created":{"date-parts":[[2010,4,26]],"date-time":"2010-04-26T17:35:55Z","timestamp":1272303355000},"page":"2112-2120","source":"Crossref","is-referenced-by-count":101,"title":["Correcting Charge-Constrained Errors in the Rank-Modulation Scheme"],"prefix":"10.1109","volume":"56","author":[{"family":"Anxiao Jiang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moshe","family":"Schwartz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jehoshua","family":"Bruck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","article-title":"decoding of permutation codes","author":"cohen","year":"1977","journal-title":"Colloques Int CNRS"},{"key":"ref11","first-page":"1","article-title":"an algebraic approach to association schemes of coding theory","volume":"10","author":"delsarte","year":"1973","journal-title":"Philips J Res"},{"key":"ref12","first-page":"173","article-title":"metrics on permutations, a survey","volume":"23","author":"deza","year":"1998","journal-title":"J Combin Inform Syst Sci"},{"key":"ref13","article-title":"on maximal numbers of permutations with given maximal or minimal distance","volume":"22","author":"deza","year":"1977","journal-title":"J Combin Theory Ser A"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/0118025"},{"key":"ref15","author":"hall","year":"1999","journal-title":"The Theory of Groups"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018336"},{"key":"ref17","author":"kendall","year":"1990","journal-title":"Rank Correlation Methods"},{"key":"ref18","author":"knuth","year":"1998","journal-title":"The Art of Computer Programming Volume 3 Sorting and Searching"},{"key":"ref19","first-page":"441","article-title":"on a simple term of a determinant","volume":"21","author":"muir","year":"1898","journal-title":"Proc Royal Soc Edinburg"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055142"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054729"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74341-2"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(79)90076-7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1970.1054527"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5015-0"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2005.1465045"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054291"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008394205999"},{"key":"ref20","article-title":"a survey on packing and covering problems in the hamming permutations space","volume":"13","author":"quistorff","year":"2006","journal-title":"Elec J Comb"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1965.3680"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2001.3188"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2000.866429"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2010.5454091"},{"key":"ref25","first-page":"1234","article-title":"on the capacity of bounded rank modulation for flash memories","author":"wang","year":"2009","journal-title":"Proc IEEE Int Symp Inf Theory"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5452181\/05452201.pdf?arnumber=5452201","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T01:01:02Z","timestamp":1633914062000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5452201\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5]]},"references-count":25,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2043764","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5]]}}}