{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T09:41:40Z","timestamp":1729676500496,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620524","type":"proceedings-article","created":{"date-parts":[[2013,10,11]],"date-time":"2013-10-11T22:57:32Z","timestamp":1381532252000},"page":"1734-1738","source":"Crossref","is-referenced-by-count":1,"title":["Channels with cost constraints: Strong converse and dispersion"],"prefix":"10.1109","author":[{"given":"Victoria","family":"Kostina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Verdu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2238657"},{"journal-title":"A Tight Upper Bound for the Third-Order Asymptotics of Discrete Memoryless Channels","year":"2012","author":"tomamichel","key":"22"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284676"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176996454"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2186786"},{"key":"24","volume":"2","author":"feller","year":"1971","journal-title":"An Introduction to Probability Theory and Its Applications"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030478"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.2996\/kmj\/1138844948"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(68)90200-3"},{"key":"11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12066-8","author":"han","year":"2003","journal-title":"Information Spectrum Methods in Information Theory"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1959.tb03905.x"},{"journal-title":"Channel Coding Non-Asymptotic Fundamental Limits","year":"2010","author":"polyanskiy","key":"21"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055007"},{"key":"20","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-87859-1","author":"inlar","year":"2011","journal-title":"Probability and Stochastics"},{"key":"2","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1215\/ijm\/1255455455","article-title":"Strong converse of the coding theorem for semicontinuous channels","volume":"3","author":"wolfowitz","year":"1959","journal-title":"Illinois Journal of Mathematics"},{"key":"1","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 Journal of Mathematics"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(60)90317-X"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(59)90066-X"},{"key":"5","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1215\/ijm\/1255454549","article-title":"The maximum achievable length of an error correcting code","volume":"2","author":"wolfowitz","year":"1958","journal-title":"Illinois Journal of Mathematics"},{"key":"4","first-page":"375","article-title":"Strong converses for a general memoryless channel with feedback","author":"kemperman","year":"1971","journal-title":"Proceedings 6th Prague Conference on Information Theory Statistical Decision Functions and Random Processes"},{"journal-title":"Information and Information Stability of Random Variables and Processes","year":"1964","author":"pinsker","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/18.335960"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2013,7,7]]},"location":"Istanbul, Turkey","end":{"date-parts":[[2013,7,12]]}},"container-title":["2013 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6597029\/6620166\/06620524.pdf?arnumber=6620524","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T15:02:29Z","timestamp":1564498949000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620524\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620524","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}