{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:04:21Z","timestamp":1774991061031,"version":"3.50.1"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541317","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"340-344","source":"Crossref","is-referenced-by-count":5,"title":["The unbounded benefit of encoder cooperation for the k-user MAC"],"prefix":"10.1109","author":[{"given":"Parham","family":"Noorzad","sequence":"first","affiliation":[{"name":"California Institute of Technology, USA"}]},{"given":"Michelle","family":"Effros","sequence":"additional","affiliation":[{"name":"California Institute of Technology, USA"}]},{"given":"Michael","family":"Langberg","sequence":"additional","affiliation":[{"name":"State University of New York at Buffalo, USA"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Multi-way communication channels","author":"ahlswede","year":"1971","journal-title":"Proc Int Symp Information Theory"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176996549"},{"key":"ref12","article-title":"Multiple access channels","author":"liao","year":"1972"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2008.5074367"},{"key":"ref14","article-title":"The unbounded benefit of encoder cooperation for the k-user MAC (Extended version)","author":"noorzad","year":"2016"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2007.55"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(79)90337-1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056660"},{"key":"ref6","first-page":"120","article-title":"A proof of Marton's coding theorem for the discrete memoryless broadcast channel","volume":"it 27","author":"el","year":"1981","journal-title":"IEEE Trans Inf Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056046"},{"key":"ref8","article-title":"The multivariate covering lemma and its converse","author":"noorzad","year":"2015"},{"key":"ref7","author":"el gamal","year":"2012","journal-title":"Network Information Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282412"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875411"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(75)90371-X"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541317.pdf?arnumber=7541317","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:53:08Z","timestamp":1774986788000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541317\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541317","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}