{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:01:23Z","timestamp":1774990883857,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541863","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"3067-3071","source":"Crossref","is-referenced-by-count":1,"title":["Distance preserving maps and combinatorial joint source-channel coding for large alphabets"],"prefix":"10.1109","author":[{"given":"Arya","family":"Mazumdar","sequence":"first","affiliation":[{"name":"University of Massachusetts at Amherst, 01002, USA"}]},{"given":"Yury","family":"Polyanskiy","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, 02139, USA"}]},{"given":"Ankit Singh","family":"Rawat","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA 15213, USA"}]},{"given":"Hajir","family":"Roozbehani","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, 02139, USA"}]}],"member":"263","reference":[{"key":"ref10","author":"macwilliams","year":"1978","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620457"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282459"},{"key":"ref13","article-title":"On metric properties of maps between hamming spaces and related graph homomorphisms","author":"polyanskiy","year":"2015","journal-title":"preprint arXiv 1503 02779"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282457"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094812"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.556669"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056678"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11122-005-0007-5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283735"},{"key":"ref7","first-page":"1","article-title":"On the bit error rate of repeated error-correcting codes","author":"gao","year":"2014","journal-title":"Proc 2014 Conf Inf Sci Systems (CISS)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1006\/aama.1998.0588"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90002-Y"},{"key":"ref9","first-page":"10","author":"kochman","year":"2012","journal-title":"Proc IEEE Information Theory Workshop (ITW)"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541863.pdf?arnumber=7541863","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:52:11Z","timestamp":1774986731000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541863\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541863","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}