{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T10:04:00Z","timestamp":1730196240982,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1109\/allerton.2010.5706943","type":"proceedings-article","created":{"date-parts":[[2011,2,3]],"date-time":"2011-02-03T16:50:52Z","timestamp":1296751852000},"page":"466-473","source":"Crossref","is-referenced-by-count":0,"title":["An explicit construction of concatenated codes for multiple access channels"],"prefix":"10.1109","author":[{"given":"Hideki","family":"Yagi","sequence":"first","affiliation":[]},{"given":"H. Vincent","family":"Poor","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057104"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.179365"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1973.tb02004.x"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.335905"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.568709"},{"year":"1998","author":"van lint","key":"ref15"},{"key":"ref16","article-title":"Polynomial-time decodable codes for multiple access channels","author":"yagi","year":"2010","journal-title":"IEEE Commun Lett"},{"journal-title":"Proc IEEE Int Symp on Inform Theory","article-title":"Coding for multiple access channels with common information based on LDPC codes","year":"2010","key":"ref17"},{"key":"ref4","article-title":"Concatenated codes and their multilevel generalizations","volume":"2","author":"dumer","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056525"},{"article-title":"Information Theory and Reliable Communication","year":"1968","author":"gallager","key":"ref6"},{"article-title":"Concatenated Codes","year":"1966","author":"forney","key":"ref5"},{"key":"ref8","article-title":"A coding theorem for multiple access communications","author":"liao","year":"1972","journal-title":"Proc IEEE Int Symp on Inform Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057022"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref1","first-page":"23","article-title":"Multi-way communication channels","author":"ahlswede","year":"1971","journal-title":"Proc IEEE Int Symp on Inform Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056274"}],"event":{"name":"2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2010,9,29]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2010,10,1]]}},"container-title":["2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5701578\/5706874\/05706943.pdf?arnumber=5706943","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T02:17:08Z","timestamp":1490062628000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5706943\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/allerton.2010.5706943","relation":{},"subject":[],"published":{"date-parts":[[2010,9]]}}}