{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:58:01Z","timestamp":1773377881526,"version":"3.50.1"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"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":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518275","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2471-2476","source":"Crossref","is-referenced-by-count":5,"title":["Near-Optimal Coding for Massive Multiple Access"],"prefix":"10.1109","author":[{"given":"Kuan","family":"Hsieh","sequence":"first","affiliation":[{"name":"University of Cambridge,UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cynthia","family":"Rush","sequence":"additional","affiliation":[{"name":"Columbia University,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramji","family":"Venkataramanan","sequence":"additional","affiliation":[{"name":"University of Cambridge,UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849802"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174035"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173954"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"18914","DOI":"10.1073\/pnas.0909892106","article-title":"Message-passing algorithms for compressed sensing","volume":"106","author":"donoho","year":"0","journal-title":"Proc Natl Acad Sci U S A"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.2.021005"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2274513"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2713833"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541484"},{"key":"ref18","author":"rush","year":"2020","journal-title":"Capacity-achieving spatially coupled sparse superposition codes with AMP decoding"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437615"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849288"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1080\/00018732.2016.1211393"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849764"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2668391"},{"key":"ref5","author":"kowshik","year":"2020","journal-title":"Fundamental Limits of Many-User MAC with Finite Payloads and Fading"},{"key":"ref8","first-page":"139","article-title":"On the per-user probability of error in Gaussian many-access channels","author":"ravi","year":"0","journal-title":"Proc Int Zurich Seminar on Communication"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849751"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006984"},{"key":"ref9","first-page":"3025","article-title":"Capacity per unit-energy of Gaussian random many-access channels","author":"ravi","year":"0","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref1","author":"hsieh","year":"0","journal-title":"Near optimal coding for massive multiple access"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847700"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2937335"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2177575"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2280915"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095072"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2438870"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2352296"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518275.pdf?arnumber=9518275","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:27Z","timestamp":1773347727000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518275\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518275","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}