{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:52:59Z","timestamp":1773377579605,"version":"3.50.1"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1908725,CCF-1901243"],"award-info":[{"award-number":["CCF-1908725,CCF-1901243"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518136","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2220-2225","source":"Crossref","is-referenced-by-count":1,"title":["A Wringing-Based Proof of a Second-Order Converse for the Multiple-Access Channel under Maximal Error Probability"],"prefix":"10.1109","author":[{"given":"Fei","family":"Wei","sequence":"first","affiliation":[{"name":"Arizona State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Kosut","sequence":"additional","affiliation":[{"name":"Arizona State University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF00531808"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2570243"},{"key":"ref12","first-page":"689","article-title":"Asymptotic estimates in shannon's information theory","author":"strassen","year":"0","journal-title":"The 3rd Prague Conference on Information Theory Statistical Decision Functions Random Processes"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2291231"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/EEEI.2012.6376904"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284677"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2371026"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2492547"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7283000"},{"key":"ref4","article-title":"Multi-way communication channels","author":"ahlswede","year":"1971","journal-title":"Second International Symposium on Information Theory Tsahkadsor"},{"key":"ref3","author":"liao","year":"1972","journal-title":"Multiple access channels"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/B978-0-12-010904-3.50011-7","article-title":"Some advances in broadcast channels","volume":"4","author":"cover","year":"1975","journal-title":"Advances in Communication Systems"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055171"},{"key":"ref8","first-page":"187","article-title":"The strong converse to the coding theorem for the multiple access channel","volume":"6","author":"dueck","year":"1981","journal-title":"Journal of Combinatorics Information and System Sciences"},{"key":"ref7","first-page":"11","article-title":"Maximal error capacity regions are smaller than average error capacity regions for multiple-user channels","volume":"7","author":"dueck","year":"1978","journal-title":"Problems of Control and Information Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687"},{"key":"ref1","article-title":"Two-way communication channels","author":"shannon","year":"1961","journal-title":"Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability Volume 1 Contributions to the Theory of Statistics"},{"key":"ref9","article-title":"An elementary proof of the strong converse theorem for the multiple access channel","volume":"7","author":"ahlswede","year":"1982","journal-title":"J Combinatorics Information and System Sciences"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2487340"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2013.6503004"},{"key":"ref21","article-title":"A second-order converse bound for the multiple-access channel via wringing dependence","author":"kosut","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref23","article-title":"Asymptotic estimates in information theory with nonvanishing error probabilities","author":"tan","year":"2015","journal-title":"ArXiv Preprint"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518136.pdf?arnumber=9518136","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:27Z","timestamp":1773347667000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518136\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518136","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}