{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:18:18Z","timestamp":1774678698819,"version":"3.50.1"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"DARPA under the ITMANET Program"},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF 12-19145"],"award-info":[{"award-number":["CCF 12-19145"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1109\/tit.2016.2643681","type":"journal-article","created":{"date-parts":[[2017,1,2]],"date-time":"2017-01-02T19:06:28Z","timestamp":1483383988000},"page":"2278-2313","source":"Crossref","is-referenced-by-count":27,"title":["The Log-Volume of Optimal Codes for Memoryless Channels, Asymptotically Within a Few Nats"],"prefix":"10.1109","volume":"63","author":[{"given":"Pierre","family":"Moulin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.2307\/1400905"},{"key":"ref32","first-page":"291","article-title":"An Information theoretical identity and a problem involving capacity","volume":"2","author":"tops\u00f8e","year":"1967","journal-title":"Stud Sci Math Hungar"},{"key":"ref31","author":"ash","year":"1965","journal-title":"Information Theory"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.179368"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2236382"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5320-4"},{"key":"ref34","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1923-9","author":"lehman","year":"1986","journal-title":"Testing Statistical Hypotheses"},{"key":"ref10","article-title":"The log-volume of optimal codes for memoryless channels, asymptotically within a few nats","author":"moulin","year":"2013"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620484"},{"key":"ref12","article-title":"The third-order term in the normal approximation for singular channels","author":"altug","year":"2013"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620522"},{"key":"ref14","article-title":"Nonasymptotic universal channel coding","author":"moulin","year":"0"},{"key":"ref15","first-page":"61801","article-title":"The log-volume of optimal codes for memoryless channels, up to a few nats","author":"moulin","year":"2012","journal-title":"Proc ITA"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284676"},{"key":"ref17","first-page":"1541","article-title":"Asymptotic Neyman-Pearson games for converse to the channel coding theoremorem","author":"moulin","year":"2013","journal-title":"Proc ISIT"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706094"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177705674"},{"key":"ref28","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref4","first-page":"211","article-title":"Mathematical problems in the Shannon theory of optimal coding of information","author":"dobrushin","year":"1961","journal-title":"Proc 4th Berkeley Symp"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/18.370121"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-01510-0"},{"key":"ref6","author":"kemperman","year":"1962","journal-title":"Studies in Coding Theory I"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2008.4601087"},{"key":"ref5","first-page":"1","article-title":"Asymptotische abschätzungen in Shannon’s informationstheorie","author":"strassen","year":"1962","journal-title":"Proc Trans 3rd Prague Conf Inf Theory"},{"key":"ref8","article-title":"Channel coding: Non-asymptotic fundamental limits","author":"polyanskiy","year":"2010"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/113744"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030478"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706528"},{"key":"ref22","author":"barndorff-nielsen","year":"1991","journal-title":"Asymptotic Techniques for Use in Statistics"},{"key":"ref21","author":"feller","year":"1971","journal-title":"An Introduction to Probability Theory and Its Applications"},{"key":"ref24","first-page":"5","article-title":"Sur un nouveau théorème-limite de la théorie des probabilités","volume":"736","author":"cram\u00e9r","year":"1938","journal-title":"Actualités Sci et Ind"},{"key":"ref23","author":"dasgupta","year":"2008","journal-title":"Asymptotic Theory of Statistics and Probability"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176989136"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392223"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/ieeexplore.ieee.org\/ielaam\/18\/7879182\/7803558-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx7\/18\/7879182\/07803558.pdf?arnumber=7803558","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:55:05Z","timestamp":1649444105000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/ieeexplore.ieee.org\/document\/7803558\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4]]},"references-count":36,"journal-issue":{"issue":"4"},"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1109\/tit.2016.2643681","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4]]}}}