{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:09:33Z","timestamp":1729652973631,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1109\/itw.2017.8277982","type":"proceedings-article","created":{"date-parts":[[2018,2,7]],"date-time":"2018-02-07T15:45:14Z","timestamp":1518018314000},"page":"359-363","source":"Crossref","is-referenced-by-count":0,"title":["Codes for T-user asymmetric multiple-access channel with independent sources"],"prefix":"10.1109","author":[{"given":"Shan","family":"Lu","sequence":"first","affiliation":[]},{"given":"Hiroshi","family":"Kamabe","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","first-page":"23","article-title":"Lower bounds for the error probability of multiple access channels","volume":"11","author":"haroutunian","year":"1975","journal-title":"Probl Peredach Inform"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2265553"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480194265623"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057193"},{"key":"ref11","first-page":"507","article-title":"Coding scheme for T-user noisy multiple-access adder channel","author":"lu","year":"0","journal-title":"Proc 2014 International Symposium on Information Theory and its Applications (ISITA)"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"1037","DOI":"10.1002\/j.1538-7305.1973.tb02004.x","article-title":"A coding theorem for multiple access channels with correlated sources","volume":"52","author":"slepian","year":"1973","journal-title":"Bell Syst Tech J"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1977","author":"macwilliams","key":"ref12"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056109"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E99.A.2202"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref9","first-page":"2303","article-title":"A multi-user k-ary code for noisy multiple-access adder channel","volume":"it 47","author":"cheng","year":"2001","journal-title":"IEEE Trans Inform Thoery"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057342"}],"event":{"name":"2017 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2017,11,6]]},"location":"Kaohsiung, Taiwan","end":{"date-parts":[[2017,11,10]]}},"container-title":["2017 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8266764\/8277915\/08277982.pdf?arnumber=8277982","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T09:58:48Z","timestamp":1570701528000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8277982\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/itw.2017.8277982","relation":{},"subject":[],"published":{"date-parts":[[2017,11]]}}}