{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T01:14:34Z","timestamp":1745370874007,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1109\/vetecs.2011.5956470","type":"proceedings-article","created":{"date-parts":[[2011,7,21]],"date-time":"2011-07-21T11:16:25Z","timestamp":1311246985000},"page":"1-6","source":"Crossref","is-referenced-by-count":3,"title":["Low-Complexity Strategies for Multiple Access Relaying"],"prefix":"10.1109","author":[{"given":"Pen-Shun","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valtteri","family":"Tervo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khoirul","family":"Anwar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tadashi","family":"Matsumoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TURBOCODING.2008.4658706"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2009.5199246"},{"key":"ref12","article-title":"TURBO-Coded Decode-And-Forward Strategy Resilient to Relay Errors","author":"sneesens","year":"2008","journal-title":"ICASSP"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/4234.957380","article-title":"Compression of correlated binary sources using turbo codes","volume":"5","author":"zhao","year":"2001","journal-title":"IEEE Commun Lett"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.485714"},{"key":"ref16","first-page":"1358","article-title":"Convergence prediction for iterative decoding of three-fold concatenated systems","author":"tuchler","year":"2002"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1587\/transcom.E92.B.3470"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1049\/cp:20050196"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1049\/el:19970362"},{"key":"ref8","article-title":"Network coding over a noise relay: a belief progagation approach","author":"yang","year":"2007","journal-title":"Proc ISIT"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.881630"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2009.090201"},{"key":"ref1","article-title":"A Share-relay Cooperative Diversity Scheme Based on Joint Channel and Network Coding","author":"xu","year":"2008","journal-title":"ISITA 2008"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2009.4917933"}],"event":{"name":"2011 IEEE Vehicular Technology Conference (VTC 2011-Spring)","start":{"date-parts":[[2011,5,15]]},"location":"Budapest, Hungary","end":{"date-parts":[[2011,5,18]]}},"container-title":["2011 IEEE 73rd Vehicular Technology Conference (VTC Spring)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5954014\/5956103\/05956470.pdf?arnumber=5956470","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T23:27:58Z","timestamp":1497914878000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5956470\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/vetecs.2011.5956470","relation":{},"subject":[],"published":{"date-parts":[[2011,5]]}}}