{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:49:12Z","timestamp":1774680552580,"version":"3.50.1"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2014,3,1]],"date-time":"2014-03-01T00:00:00Z","timestamp":1393632000000},"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":[[2014,3]]},"DOI":"10.1109\/tit.2014.2299275","type":"journal-article","created":{"date-parts":[[2014,1,31]],"date-time":"2014-01-31T19:01:21Z","timestamp":1391194881000},"page":"1592-1614","source":"Crossref","is-referenced-by-count":28,"title":["Refinement of the Sphere-Packing Bound: Asymmetric Channels"],"prefix":"10.1109","volume":"60","author":[{"given":"Yucel","family":"Altug","sequence":"first","affiliation":[]},{"given":"Aaron B.","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1949-007-x"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"151","DOI":"10.7146\/math.scand.a-10714","article-title":"Minimax theorems and conjugate saddle-functions","volume":"14","author":"rockafellar","year":"1964","journal-title":"Math Scand"},{"key":"ref33","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841059","author":"ruszczy?ski","year":"2006","journal-title":"Nonlinear Optimization"},{"key":"ref32","author":"durrett","year":"2005","journal-title":"Probability Theory and Examples"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5320-4"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177705674"},{"key":"ref37","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","author":"rockafellar","year":"1970","journal-title":"Convex Analysis"},{"key":"ref36","author":"bertsekas","year":"2003","journal-title":"Convex Analysis and Optimization"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176989136"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055254"},{"key":"ref10","author":"blahut","year":"1987","journal-title":"Principles and Practice of Information Theory"},{"key":"ref40","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02796-7","author":"hiriart-urruty","year":"1993","journal-title":"Convex Analysis and Minimization Algorithms Fundamentals"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref12","author":"csisz\ufffdr","year":"1981","journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838090"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920216"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"4947","DOI":"10.1109\/TIT.2009.2030478","article-title":"Information spectrum approach to second-order coding rate in channel coding","volume":"55","author":"hayashi","year":"2009","journal-title":"IEEE Trans Inf Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref17","first-page":"265","article-title":"Moderate deviation analysis of channel coding: Discrete memoryless case","author":"altu?","year":"2010","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707068"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284675"},{"key":"ref28","article-title":"Refinement of the random coding bound","author":"altu?","year":"0","journal-title":"IEEE Trans Inform Theory"},{"key":"ref4","first-page":"689","article-title":"Asymptotische absch\ufffdtzungen in Shannon's informationstheorie","author":"strassen","year":"1962","journal-title":"Proc Trans 3rd Prague Conf Inf Theory"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1561\/0100000008"},{"key":"ref3","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"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053730"},{"key":"ref29","author":"altu?","year":"0","journal-title":"Exact asymptotics of the error probability in channel coding Symmetric channels"},{"key":"ref5","author":"fano","year":"1961","journal-title":"Transmission of Information A Statistical Theory of Communications"},{"key":"ref8","first-page":"37","article-title":"Estimates of the error exponents for the semi-continuous memoryless channel","volume":"4","author":"haroutunian","year":"1968","journal-title":"Problems Per Inf Transmiss"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)90052-6"},{"key":"ref2","first-page":"61","article-title":"Coding for two noisy channels","author":"elias","year":"1955","journal-title":"Proc 3rd London Symp Inf Theory"},{"key":"ref9","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284697"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2224145"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158476"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/S0040585X97985017"},{"key":"ref24","first-page":"663","article-title":"A refinement of the random coding bound","author":"altu?","year":"2012","journal-title":"Proc 50th Annu Allerton Conf Communication Control and Computing"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392223"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120146"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1008328.1008329"},{"key":"ref25","first-page":"2949","article-title":"Refinement of the sphere-packing bound","author":"altu?","year":"2012","journal-title":"Proc IEEE Int Symp Inf Theory"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6739111\/06730677.pdf?arnumber=6730677","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:29:50Z","timestamp":1642004990000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6730677\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3]]},"references-count":42,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2299275","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3]]}}}