{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:42Z","timestamp":1759638222175,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620689","type":"proceedings-article","created":{"date-parts":[[2013,10,11]],"date-time":"2013-10-11T22:57:32Z","timestamp":1381532252000},"page":"2562-2566","source":"Crossref","is-referenced-by-count":9,"title":["A rate-distortion theory for permutation spaces"],"prefix":"10.1109","author":[{"given":"Da","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arya","family":"Mazumdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory W.","family":"Wornell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511805967"},{"key":"14","first-page":"3","article-title":"The number of inversions in permutations: A saddle point approach","volume":"6","author":"louchard","year":"2003","journal-title":"Journal of Integer Sequences"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2221121"},{"journal-title":"The On-Line Encyclopedia of Integer Sequences","year":"2013","author":"shreevatsa","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046212"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828150"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(79)90076-7"},{"journal-title":"Art of Computer Programming Volume 3 Sorting and Searching","year":"1998","author":"knuth","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.08.010"},{"journal-title":"On Compressing Permutations and Adaptive Sorting","year":"2011","author":"barbay","key":"6"},{"key":"5","first-page":"111","article-title":"Compressed representations of permutations, and applications","author":"barbay","year":"2009","journal-title":"Proc 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048455"},{"key":"9","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 (Methodological)"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/11682462_49"}],"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\/06620689.pdf?arnumber=6620689","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T15:02:21Z","timestamp":1564498941000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620689\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620689","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}