{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:10Z","timestamp":1773377770705,"version":"3.50.1"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9173954","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"2995-3000","source":"Crossref","is-referenced-by-count":25,"title":["On Approximate Message Passing for Unsourced Access with Coded Compressed Sensing"],"prefix":"10.1109","author":[{"given":"Vamsi K.","family":"Amalladinne","sequence":"first","affiliation":[{"name":"Texas A&M University,Department of Electrical and Computer Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asit","family":"Kumar Pradhan","sequence":"additional","affiliation":[{"name":"Texas A&M University,Department of Electrical and Computer Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cynthia","family":"Rush","sequence":"additional","affiliation":[{"name":"Columbia University,Department of Statistics"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Francois","family":"Chamberland","sequence":"additional","affiliation":[{"name":"Texas A&M University,Department of Electrical and Computer Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krishna R.","family":"Narayanan","sequence":"additional","affiliation":[{"name":"Texas A&M University,Department of Electrical and Computer Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"An enhanced decoding algorithm for coded compressed sensing","author":"amalladinne","year":"2019","journal-title":"arXiv preprint arXiv 1910 09704"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1561\/0100000092"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8461402"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2289865"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2649460"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2776937"},{"key":"ref4","article-title":"A coded compressed sensing scheme for uncoordinated multiple access","author":"amalladinne","year":"2019","journal-title":"IEEE Trans Inform Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2940216"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM38437.2019.9013278"},{"key":"ref5","article-title":"SPARCs for unsourced random access","author":"fengler","year":"2018","journal-title":"arXiv preprint arXiv 1809 04745"},{"key":"ref8","article-title":"A polar code based unsourced random access for the Gaussian MAC","author":"marshakov","year":"2019","journal-title":"Proc Vehicular Tech Conf"},{"key":"ref7","article-title":"Chirrup: a practical algorithm for unsourced multiple access","author":"calderbank","year":"2018","journal-title":"arXiv preprint arXiv 1811 00879"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006985"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006984"},{"key":"ref9","article-title":"Polar coding and random spreading for unsourced multiple access","author":"pradhan","year":"2019","journal-title":"arXiv preprint arXiv 1911 12945"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09173954.pdf?arnumber=9173954","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:06Z","timestamp":1773347706000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9173954\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9173954","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}