{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:54:48Z","timestamp":1771613688253,"version":"3.50.1"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2014,11,1]],"date-time":"2014-11-01T00:00:00Z","timestamp":1414800000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100003968","name":"Iran National Science Foundation","doi-asserted-by":"publisher","award":["92-32575"],"award-info":[{"award-number":["92-32575"]}],"id":[{"id":"10.13039\/501100003968","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1109\/tit.2014.2351812","type":"journal-article","created":{"date-parts":[[2014,8,26]],"date-time":"2014-08-26T14:32:39Z","timestamp":1409063559000},"page":"6760-6786","source":"Crossref","is-referenced-by-count":117,"title":["Achievability Proof via Output Statistics of Random Binning"],"prefix":"10.1109","volume":"60","author":[{"given":"Mohammad Hossein","family":"Yassaee","sequence":"first","affiliation":[]},{"given":"Mohammad Reza","family":"Aref","sequence":"additional","affiliation":[]},{"given":"Amin","family":"Gohari","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","article-title":"Information-theoretic secrecy for wireless networks","author":"perron","year":"2009"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928272"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2119930"},{"key":"ref30","article-title":"Hybrid coding: An interface for joint source-channel coding and network communication","author":"minero","year":"2013"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2013.6691333"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284121"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284123"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/18.651026"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055892"},{"key":"ref11","first-page":"351","article-title":"Information-theoretic key agreement: From weak to strong secrecy for free","author":"maurer","year":"2000","journal-title":"Advances in Cryptology-Eurocrypt"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871040"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2283722"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.661498"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2010.5592953"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2011.2158422"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043781"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173716"},{"key":"ref19","article-title":"Construction of Slepian–Wolf source code and broadcast channel code based on hash property","author":"muramatsu","year":"2010"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057353"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162226"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2184668"},{"key":"ref3","article-title":"Information theory: Coding theorems for discrete memoryless systems","author":"csisz\u00e1r","year":"1997","journal-title":"Akademiai Kiado"},{"key":"ref6","article-title":"Communication in networks for coordinating behavior","author":"cuff","year":"2009"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2027512"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513744"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055346"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2279330"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.256486"},{"key":"ref1","author":"el gamal","year":"2012","journal-title":"Network Information Theory"},{"key":"ref20","first-page":"142","article-title":"Coding theorems for a discrete source with a fidelity criterion","author":"shannon","year":"1959","journal-title":"Proc IRE Nat Conv Rec"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.810622"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003843"},{"key":"ref24","first-page":"40","article-title":"Almost independence and secrecy capacity","volume":"32","author":"csisz\u00e1r","year":"1996","journal-title":"Problems Inf Transmiss"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2136910"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205803"},{"key":"ref25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12066-8","author":"han","year":"2003","journal-title":"Information-spectrum methods in information theory"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6926896\/06883160.pdf?arnumber=6883160","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:51:16Z","timestamp":1641988276000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6883160\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11]]},"references-count":37,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2351812","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11]]}}}