{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T09:49:43Z","timestamp":1729676983184,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1109\/allerton.2011.6120149","type":"proceedings-article","created":{"date-parts":[[2012,1,6]],"date-time":"2012-01-06T21:40:38Z","timestamp":1325886038000},"page":"52-59","source":"Crossref","is-referenced-by-count":4,"title":["Relative entropy at the channel output of a capacity-achieving code"],"prefix":"10.1109","author":[{"given":"Yury","family":"Polyanskiy","sequence":"first","affiliation":[]},{"given":"Sergio","family":"Verdu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0095676"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176996454"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.3160280102"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0096511"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOP592"},{"key":"3","article-title":"Asynchronous communication: Capacity, strong converse and dispersion","author":"polyanskiy","year":"2011","journal-title":"IEEE Trans Inf Theory"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2027484"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033963"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/s004400050225"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034120"},{"journal-title":"Channel Coding Non-Asymptotic Fundamental Limits","year":"2010","author":"polyanskiy","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/18.568695"},{"journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems","year":"1981","author":"csisza?r","key":"9"},{"key":"8","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1215\/ijm\/1255380682","article-title":"The coding of messages subject to chance errors","volume":"1","author":"wolfowitz","year":"1957","journal-title":"Illinois J Math"}],"event":{"name":"2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2011,9,28]]},"location":"Monticello, IL","end":{"date-parts":[[2011,9,30]]}},"container-title":["2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6111659\/6120135\/06120149.pdf?arnumber=6120149","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T05:42:20Z","timestamp":1561182140000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6120149\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/allerton.2011.6120149","relation":{},"subject":[],"published":{"date-parts":[[2011,9]]}}}