{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:13:37Z","timestamp":1761293617233,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006798","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T18:54:37Z","timestamp":1504032877000},"page":"1593-1597","source":"Crossref","is-referenced-by-count":12,"title":["Generalized approximate message-passing decoder for universal sparse superposition codes"],"prefix":"10.1109","author":[{"given":"Erdem","family":"Biyik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean","family":"Barbier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamad","family":"Dia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iat004"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2015\/05\/P05013"},{"journal-title":"Approximate message-passing decoder and capacity-achieving sparse superposition codes","year":"2015","author":"barbier","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541484"},{"journal-title":"Generalized Approximate Message Passing for Estimation with Random Linear Mixing","year":"2012","author":"rangan","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SiPS.2015.7344999"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852290"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541382"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2280915"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283048"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2289865"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2012\/08\/P08009"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"18 914","DOI":"10.1073\/pnas.0909892106","article-title":"Message-passing algorithms for compressed sensing","volume":"106","author":"donoho","year":"2009","journal-title":"Proceedings of the National Academy of Sciences"},{"journal-title":"Capacity-achieving sparse superposition codes via approximate message passing decoding","year":"2015","author":"rush","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875082"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2016.7606799"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513330"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094817"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006798.pdf?arnumber=8006798","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T22:20:30Z","timestamp":1570054830000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006798\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006798","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}