{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:14:06Z","timestamp":1771611246560,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620572","type":"proceedings-article","created":{"date-parts":[[2013,10,12]],"date-time":"2013-10-12T02:57:32Z","timestamp":1381546652000},"page":"1979-1983","source":"Crossref","is-referenced-by-count":16,"title":["Data compression with nearly uniform output"],"prefix":"10.1109","author":[{"given":"Remi A.","family":"Chou","sequence":"first","affiliation":[]},{"given":"Matthieu R.","family":"Bloch","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2013.6691225"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ITWTPI.2005.1543961"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89575"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E93.A.1650"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283010"},{"key":"13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-30576-7_30","article-title":"Entropic security and the encryption of high-entropy messages","author":"dodis","year":"2005","journal-title":"Theory of Cryptography"},{"key":"14","author":"csiszar","year":"1981","journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/18.256484"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/18.243431"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.100409"},{"key":"2","author":"lima","year":"2010","journal-title":"Network Coding Security Algebraic Properties and Lightweight Solutions"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2094592"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283039"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557284"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928985"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.840860"},{"key":"4","volume":"50","author":"han","year":"2002","journal-title":"Information-spectrum methods in information theory"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483321"},{"key":"8","author":"matsumoto","year":"2011","journal-title":"Universal Strongly Secure Network Coding with Dependent and Non-Uniform Messages"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","location":"Istanbul, Turkey","start":{"date-parts":[[2013,7,7]]},"end":{"date-parts":[[2013,7,12]]}},"container-title":["2013 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx7\/6597029\/6620166\/06620572.pdf?arnumber=6620572","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T23:46:01Z","timestamp":1498088761000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/ieeexplore.ieee.org\/document\/6620572\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":19,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/isit.2013.6620572","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}