{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T00:10:58Z","timestamp":1774051858294,"version":"3.50.1"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2011,11,1]],"date-time":"2011-11-01T00:00:00Z","timestamp":1320105600000},"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":[[2011,11]]},"DOI":"10.1109\/tit.2011.2162226","type":"journal-article","created":{"date-parts":[[2011,8,3]],"date-time":"2011-08-03T21:31:19Z","timestamp":1312407079000},"page":"7377-7385","source":"Crossref","is-referenced-by-count":96,"title":["Noisy Channel Coding via Privacy Amplification and Information Reconciliation"],"prefix":"10.1109","volume":"57","author":[{"given":"Joseph M.","family":"Renes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato","family":"Renner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/37\/5\/L01"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2177589"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158473"},{"key":"ref10","volume":"1807","author":"maurer","year":"2000","journal-title":"Lecture Notes Computer Science"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.651037"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.56.131"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839515"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262081"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1063\/1.3167288"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.813556"},{"key":"ref17","author":"bowen","year":"2006","journal-title":"Quantum Coding Theorems for Arbitrary Sources Channels and Entanglement Resources arXiv quant-ph\/0610003"},{"key":"ref18","author":"wang","year":"2010","journal-title":"One-Shot Classical-Quantum Capacity and Hypothesis Testing arXiv 1007 5456"},{"key":"ref19","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/978-3-540-30576-7_22","article-title":"Universally composable privacy amplification against quantum adversaries","volume":"3378","author":"renner","year":"2005","journal-title":"Proc 2nd Theory of Cryptography Conf ser Lecture Notes in Computer Science"},{"key":"ref4","author":"renner","year":"2005","journal-title":"Security of quantum key distribution"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"4337","DOI":"10.1109\/TIT.2009.2025545","article-title":"The operational meaning of Min- and Max-Entropy","volume":"55","author":"knig","year":"2009","journal-title":"IEEE Trans Inf Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365269"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"5840","DOI":"10.1109\/TIT.2009.2032797","article-title":"A fully quantum asymptotic equipartition property","volume":"55","author":"tomamichel","year":"2009","journal-title":"IEEE Trans Inf Theory"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2146730"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054130"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.2009.0202"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.243431"},{"key":"ref1","author":"cover","year":"2006","journal-title":"Elements of Information Theory 2nd Edition"},{"key":"ref20","first-page":"269","article-title":"Matched information rate codes for binary ISI channels","author":"ma","year":"2002","journal-title":"Proc IEEE Int Symp Information Theory"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.100.170502"},{"key":"ref21","first-page":"468","article-title":"On distribution shaping codes for partial-response channels","author":"soriaga","year":"2003","journal-title":"Proc 41st Annu Allerton Conf Communication Control and Computing"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.2010.0445"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1038\/nphys1224"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1142\/S1230161208000043"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.106.110506"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6071748\/05967913.pdf?arnumber=5967913","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:48:53Z","timestamp":1633909733000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5967913\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":32,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2162226","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11]]}}}