{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T15:15:48Z","timestamp":1784301348122,"version":"3.55.0"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council Doctoral Training Partnership Award","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1109\/jsait.2022.3158827","type":"journal-article","created":{"date-parts":[[2022,3,11]],"date-time":"2022-03-11T20:24:49Z","timestamp":1647030289000},"page":"21-36","source":"Crossref","is-referenced-by-count":10,"title":["Near-Optimal Coding for Many-User Multiple Access Channels"],"prefix":"10.1109","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7500-9980","authenticated-orcid":false,"given":"Kuan","family":"Hsieh","sequence":"first","affiliation":[{"name":"Department of Engineering, University of Cambridge, Cambridge, U.K."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cynthia","family":"Rush","sequence":"additional","affiliation":[{"name":"Department of Statistics, Columbia University, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7915-5432","authenticated-orcid":false,"given":"Ramji","family":"Venkataramanan","sequence":"additional","affiliation":[{"name":"Department of Engineering, University of Cambridge, Cambridge, U.K."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2668391"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006984"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849764"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849751"},{"key":"ref7","first-page":"139","article-title":"On the per-user probability of error in Gaussian many-access channels","volume-title":"Proc. Int. Zurich Seminar Inf. Commun.","author":"Ravi"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3139430"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849288"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3091423"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0909892106"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.2.021005"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2274513"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2184847"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2713833"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541484"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2649460"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3083733"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.804053"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847700"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2400445"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2232965"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.3390\/e23050539"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834341"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3081189"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173954"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437615"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095072"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2280915"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2014.6852099"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094817"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iat004"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2891664"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2990880"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2352296"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2111010"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.844072"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2882177"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2438870"},{"key":"ref40","article-title":"Spatially coupled sparse regression codes for single- and multi-user communications","author":"Hsieh","year":"2021"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1979.1094433"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1080\/00018732.2016.1211393"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3081368"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9414469"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518253"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/9757039\/09733034.pdf?arnumber=9733034","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T23:32:42Z","timestamp":1705534362000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9733034\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3]]},"references-count":45,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/jsait.2022.3158827","relation":{},"ISSN":["2641-8770"],"issn-type":[{"value":"2641-8770","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3]]}}}