{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:51:02Z","timestamp":1774680662762,"version":"3.50.1"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849802","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2843-2847","source":"Crossref","is-referenced-by-count":79,"title":["SPARCs and AMP for Unsourced Random Access"],"prefix":"10.1109","author":[{"given":"Alexander","family":"Fengler","sequence":"first","affiliation":[{"name":"Communication and Information Theory Chair, Technical University of Berlin"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Jung","sequence":"additional","affiliation":[{"name":"Communication and Information Theory Chair, Technical University of Berlin"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Caire","sequence":"additional","affiliation":[{"name":"Communication and Information Theory Chair, Technical University of Berlin"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"State Evolution for Approximate Message Passing with Non-Separable Functions","author":"berthier","year":"2017"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847700"},{"key":"ref12","article-title":"Mutual Information and Optimality of Approximate Message-Passing in Random Linear Estimation","author":"barbier","year":"2017"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2668391"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849802"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1980.11897"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1214\/13-EJS868"},{"key":"ref3","article-title":"A Coupled Compressive Sensing Scheme for Uncoordinated Multiple Access","author":"amalladinne","year":"2018"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094817"},{"key":"ref5","first-page":"1","article-title":"Sparse Superposition Codes are Fast and Reliable at Rates Approaching Capacity with Gaussian Noise","author":"barron","year":"2011","journal-title":"Symp A Q J Mod Foreign Lit"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2713833"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2649460"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006984"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2016.7721743"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1214\/14-AAP1010"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849802.pdf?arnumber=8849802","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:55Z","timestamp":1773347695000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849802\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849802","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}