{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:48:49Z","timestamp":1730274529854,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6033966","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T13:24:20Z","timestamp":1317907460000},"page":"2273-2277","source":"Crossref","is-referenced-by-count":6,"title":["Capacity regions of discrete asynchronous multiple access channels"],"prefix":"10.1109","author":[{"given":"Lorant","family":"Farkas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamas","family":"Koi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.915637"},{"journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems","year":"0","author":"csisz\u00e1r","key":"ref12"},{"key":"ref13","article-title":"Notes on the Capacity Regions of Discrete Asynchronous Multple Access Channels, submitted to","author":"farkas","year":"0","journal-title":"IEEE Trans Inform Theory"},{"key":"ref4","first-page":"484","volume":"it 25","author":"bierbaum","year":"1979","journal-title":"A note on the capacity region of the multi-access channel IEEE Trans Inform Theory"},{"key":"ref3","volume":"it 22","author":"gray","year":"1976","journal-title":"Sliding-Block Joint Source\/Noisy-Channel Coding Theorems IEEE Trans Inform Theory"},{"journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems","year":"1981","author":"csisz\u00e1r","key":"ref6"},{"key":"ref5","volume":"it 27","author":"cover","year":"1981","journal-title":"Asynchronous Multiple-Acces Channel Capacity IEEE Trans Inform Theory"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057012"},{"key":"ref7","first-page":"12","article-title":"Coding in an Asynchronous Multiple-Access Channel","volume":"19","author":"poltyrev","year":"1983","journal-title":"Probl Peredachi Inf"},{"article-title":"Multiple Access Channels","year":"1972","author":"liao","key":"ref2"},{"key":"ref1","first-page":"23","article-title":"Multi-way communication channels","author":"ahlswede","year":"1971","journal-title":"Proceedings of 2nd International Symposium on Information Theory Thakadsor Armenian SSR"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.30983"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06033966.pdf?arnumber=6033966","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T23:15:00Z","timestamp":1490051700000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6033966\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6033966","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}