{"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":1774678688698,"version":"3.50.1"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2014,9,1]],"date-time":"2014-09-01T00:00:00Z","timestamp":1409529600000},"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 0427385"],"award-info":[{"award-number":["CCF 0427385"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF 0448115"],"award-info":[{"award-number":["CCF 0448115"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF 1111061"],"award-info":[{"award-number":["CCF 1111061"]}],"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,9]]},"DOI":"10.1109\/tit.2014.2331952","type":"journal-article","created":{"date-parts":[[2014,6,30]],"date-time":"2014-06-30T14:32:16Z","timestamp":1404138736000},"page":"5095-5115","source":"Crossref","is-referenced-by-count":45,"title":["Error Exponent for Multiple-Access Channels: Lower Bounds"],"prefix":"10.1109","volume":"60","author":[{"given":"Ali","family":"Nazari","sequence":"first","affiliation":[]},{"given":"Achilleas","family":"Anastasopoulos","sequence":"additional","affiliation":[]},{"given":"S. Sandeep","family":"Pradhan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","author":"csisz\u00e1r","year":"1981","journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.800480"},{"key":"ref12","article-title":"Multi-way communication channels","author":"ahlswede","year":"1971","journal-title":"Proc Int Symp Inform Theory"},{"key":"ref13","article-title":"A coding theorem for multiple-access communications","author":"liao","year":"1972","journal-title":"Proc Int Symp Inform Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1973.tb02004.x"},{"key":"ref15","first-page":"357","article-title":"Random constant composition codes for multiple-access channels","volume":"31","author":"dyachkov","year":"1984","journal-title":"Problems Control Inf Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057022"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057104"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.485710"},{"key":"ref19","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 Inform"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)90052-6"},{"key":"ref3","author":"fano","year":"1961","journal-title":"Transmission of Information A Statistical Theory of Communication"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF00531808"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)91200-4"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054971"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1955.1055131"},{"key":"ref2","first-page":"283","article-title":"Asymptotic bounds of the probability of error for the transmission of messages over a discrete memoryless channel with a symmetric transition probability matrix","volume":"7","author":"dobrusin","year":"1962","journal-title":"Theory Probab Appl"},{"key":"ref9","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communications"},{"key":"ref1","first-page":"37","article-title":"Coding for noisy channels","author":"elias","year":"1955","journal-title":"IRE Conv Rec"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595240"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056281"},{"key":"ref21","article-title":"Error exponent for multiple-access channels: Upper bounds","author":"nazari","year":"2011","journal-title":"IEEE Trans Inf Theory"},{"key":"ref24","article-title":"Error exponent for discrete memoryless multiple-access channels","author":"nazari","year":"2011"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054330"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<467::AID-RSA15>3.0.CO;2-W"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6878505\/06846337.pdf?arnumber=6846337","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:50:27Z","timestamp":1641988227000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6846337\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":25,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2331952","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9]]}}}