{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:18:08Z","timestamp":1774678688683,"version":"3.50.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T00:00:00Z","timestamp":1412121600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1218578"],"award-info":[{"award-number":["CCF-1218578"]}],"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":[[2014,10]]},"DOI":"10.1109\/tit.2014.2345374","type":"journal-article","created":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T17:03:31Z","timestamp":1406912611000},"page":"6005-6023","source":"Crossref","is-referenced-by-count":30,"title":["Refinement of the Random Coding Bound"],"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":"crossref","DOI":"10.1515\/9781400841059","author":"ruszczy?ski","year":"2006","journal-title":"Nonlinear Optimization"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2323418"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176989136"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993665"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1561\/0100000009"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.805064"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1515\/dma.1996.6.4.361"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-3758(96)00083-3"},{"key":"ref10","first-page":"37","article-title":"Estimates of the error exponents for the semi-continuous memoryless channel","volume":"4","author":"haroutunian","year":"1968","journal-title":"(in Russian) Probl Peredachi Inf"},{"key":"ref40","author":"durrett","year":"2005","journal-title":"Probability Theory and Examples"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1107027"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2299275"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054971"},{"key":"ref15","article-title":"Exact asymptotics of the error probability in channel coding: Symmetric channels","author":"altu?","year":"0"},{"key":"ref16","article-title":"A refinement of the random coding bound","author":"altu?","year":"2012","journal-title":"Proc Int Zurich Seminar Commun"},{"key":"ref17","first-page":"663","article-title":"A refinement of the random coding bound","author":"altu?","year":"2012","journal-title":"Proc 50th Annu Allerton Conf Commun Control Comput"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736628"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2310453"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/18.335935"},{"key":"ref4","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/18.61116"},{"key":"ref3","first-page":"61","article-title":"Coding for two noisy channels","author":"elias","year":"1955","journal-title":"Proc 3rd London Symp Inf Theory"},{"key":"ref6","author":"csisz\u00e1r","year":"1981","journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/18.923750"},{"key":"ref5","author":"blahut","year":"1987","journal-title":"Principles and Practice of Information Theory"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053730"},{"key":"ref7","author":"fano","year":"1961","journal-title":"Transmission of Information A Statistical Theory of Communications"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(57)90039-6"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)90052-6"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057459"},{"key":"ref20","article-title":"Multi-access communications with decision feedback decoding","author":"telatar","year":"1992"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1112\/plms\/s2-16.1.273","article-title":"On multiple integration by parts and the second theorem of the mean","volume":"s2","author":"young","year":"1917","journal-title":"Proc London Math Soc"},{"key":"ref22","article-title":"The third-order term in the normal approximation for singular channels","author":"altu?","year":"0","journal-title":"IEEE Trans Inf Theory"},{"key":"ref21","article-title":"Channel coding: Non-asymptotic fundamental limits","author":"polyanskiy","year":"2010"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392223"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177705674"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5320-4"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2276077"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/BF00531753"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1980.11696"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/S0040585X97985017"},{"key":"ref25","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6895347\/06870478.pdf?arnumber=6870478","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:51:19Z","timestamp":1641988279000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6870478\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":45,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2345374","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10]]}}}