{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:32:28Z","timestamp":1774679548910,"version":"3.50.1"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering within the NSF through the CAREER","doi-asserted-by":"publisher","award":["CCF-0448115"],"award-info":[{"award-number":["CCF-0448115"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering within the NSF through the CAREER","doi-asserted-by":"publisher","award":["CCF-0915619"],"award-info":[{"award-number":["CCF-0915619"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1109\/tit.2015.2424959","type":"journal-article","created":{"date-parts":[[2015,4,21]],"date-time":"2015-04-21T18:53:09Z","timestamp":1429642389000},"page":"3605-3621","source":"Crossref","is-referenced-by-count":7,"title":["Error Exponent for Multiple Access Channels: Upper Bounds"],"prefix":"10.1109","volume":"61","author":[{"given":"Ali","family":"Nazari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Sandeep","family":"Pradhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Achilleas","family":"Anastasopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"23","article-title":"Lower bound for the error probability of multiple-access channels","volume":"11","author":"haroutunian","year":"1975","journal-title":"Problemy Peredachi Inf"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)90052-6"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)91200-4"},{"key":"ref13","author":"blahut","year":"1987","journal-title":"Principles and Practice of Information Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.720546"},{"key":"ref15","author":"csisz\u00e1r","year":"1981","journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems"},{"key":"ref16","first-page":"11","article-title":"Maximal error capacity regions are smaller than average error capacity regions for multi-user channels","volume":"7","author":"dueck","year":"1978","journal-title":"Problems Control Inf Theory"},{"key":"ref17","first-page":"187","article-title":"The strong converse of the coding theorem for the multi-user channels","volume":"6","author":"dueck","year":"1981","journal-title":"J Combin Inform Syst Sci"},{"key":"ref18","first-page":"216","article-title":"An elementary proof of the strong converse theorem for the multiple-access channel","volume":"7","author":"ahlswede","year":"1982","journal-title":"J Combin Inform Syst Sci"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055792"},{"key":"ref4","first-page":"357","article-title":"Random constant composition codes for multiple-access channels","volume":"13","author":"dyachkov","year":"1984","journal-title":"Problems Control Inf Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1973.tb02004.x"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057104"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057022"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2331952"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.485710"},{"key":"ref2","article-title":"A coding theorem for multiple-access communications","author":"liao","year":"1972","journal-title":"Proc Int Symp Inf Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033680"},{"key":"ref1","first-page":"23","article-title":"Multi-way communication channels","author":"ahlswede","year":"1971","journal-title":"Proc 2nd Int Symp Inf Theory"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054148"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205760"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056281"},{"key":"ref24","first-page":"23","article-title":"On two-way communication channels and a problem by Zarankiewicz","author":"ahlswede","year":"1971","journal-title":"Proc Trans 6th Prague Conf Inf Theory Statist Decision Funct Random Process"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF00531808"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7122957\/07090963.pdf?arnumber=7090963","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:01:49Z","timestamp":1642003309000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7090963\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":25,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2424959","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7]]}}}