{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:06:36Z","timestamp":1755219996567,"version":"3.43.0"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437822","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"1844-1848","source":"Crossref","is-referenced-by-count":5,"title":["Exact Asymptotics of Random Coding Error Probability for General Memoryless Channels"],"prefix":"10.1109","author":[{"given":"Junya","family":"Honda","sequence":"first","affiliation":[{"name":"The University of Tokyo &#x0026; RIKEN"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2616900"},{"journal-title":"Comprehensive analysis on exact asymptotics of random coding error probability","year":"2017","author":"honda","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1968-11923-8"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0047-259X(91)90093-H"},{"key":"ref4","first-page":"93","article-title":"Lower bound for ensemble-average error probability for a discrete memoryless channel","volume":"16","author":"d\u2018yachkov","year":"1980","journal-title":"Problems of Information Transmission"},{"journal-title":"Information Theory and Reliable Communication","year":"1968","author":"gallager","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054971"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/1107027"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2310453"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2345374"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030478"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282423"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437822.pdf?arnumber=8437822","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T17:42:23Z","timestamp":1754588543000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437822\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437822","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}