{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:11:48Z","timestamp":1771611108217,"version":"3.50.1"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2012,2,1]],"date-time":"2012-02-01T00:00:00Z","timestamp":1328054400000},"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":[[2012,2]]},"DOI":"10.1109\/tit.2011.2173716","type":"journal-article","created":{"date-parts":[[2012,2,7]],"date-time":"2012-02-07T21:19:58Z","timestamp":1328649598000},"page":"671-692","source":"Crossref","is-referenced-by-count":14,"title":["Construction of Codes for the Wiretap Channel and the Secret Key Agreement From Correlated Source Outputs Based on the Hash Property"],"prefix":"10.1109","volume":"58","author":[{"given":"Jun","family":"Muramatsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigeki","family":"Miyake","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"key":"ref32","first-page":"105","article-title":"Construction of wiretap channel codes by using sparse matrices","author":"muramatsu","year":"2009","journal-title":"Proc IEEE Inf Theory Workshop"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046214"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054412"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205945"},{"key":"ref35","author":"uyematsu","year":"1998","journal-title":"Gendai Shannon Riron"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.901143"},{"key":"ref10","first-page":"40","article-title":"Almost independence and secrecy capacity","volume":"32","author":"csiszr","year":"1996","journal-title":"Probl Inf Transm"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.720546"},{"key":"ref12","author":"csiszr","year":"1981","journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055892"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.42171"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871040"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110950"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1109\/TIT.1965.1053719","article-title":"Single-error-correcting codes for constant-weight data words","volume":"it 11","author":"kautz","year":"1965","journal-title":"IEEE Trans Inf Theory"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e89-a.7.2036"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.476316"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e89-a.7.2036"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.824917"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2005.90"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e89-a.10.2589"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900023"},{"key":"ref8","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055356"},{"key":"ref2","first-page":"40","article-title":"Strong secrecy for wireless channels","volume":"5155","author":"barros","year":"0","journal-title":"Proc ICITS 2008"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056524"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.243431"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523623"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.256484"},{"key":"ref21","first-page":"411","author":"krner","year":"1977","journal-title":"Topics in Information Theory Keszthely (Hungary) 1975 Colloq Math Soc"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/3-540-45539-6_24","article-title":"Information-theoretic key agreement: From weak to strong secrecy for free","volume":"1807","author":"maurer","year":"2000","journal-title":"Proc Eurocrypt 2000"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-2694-0_27"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.855604"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595176"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6145469\/06145527.pdf?arnumber=6145527","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:53:36Z","timestamp":1633910016000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6145527\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2]]},"references-count":37,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2173716","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2]]}}}