{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:08:22Z","timestamp":1772906902138,"version":"3.50.1"},"reference-count":78,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-17-17842"],"award-info":[{"award-number":["CCF-17-17842"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Skoltech\u2013MIT Joint Next Generation Program"},{"name":"MIT-IBM Watson AI Lab"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1109\/tit.2021.3091423","type":"journal-article","created":{"date-parts":[[2021,6,23]],"date-time":"2021-06-23T19:56:08Z","timestamp":1624478168000},"page":"5853-5884","source":"Crossref","is-referenced-by-count":42,"title":["Fundamental Limits of Many-User MAC With Finite Payloads and Fading"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5440-6186","authenticated-orcid":false,"given":"Suhas S.","family":"Kowshik","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2109-0979","authenticated-orcid":false,"given":"Yury","family":"Polyanskiy","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref73","first-page":"1132","article-title":"The optimal received power distribution for ic-based iterative multiuser joint decoders","volume":"39","author":"caire","year":"2001","journal-title":"Proc Annu Allerton Conf Commun Control Comput"},{"key":"ref72","article-title":"Massive MIMO unsourced random access","author":"fengler","year":"2019","journal-title":"arXiv 1901 00828"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP45676.2019.9022473"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP45676.2019.9022473"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1017\/9781108231596"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2014.6804281"},{"key":"ref74","author":"polyanskiy","year":"2010","journal-title":"Channel Coding Non-Asymptotic Fundamental Limits"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2882177"},{"key":"ref75","author":"ledoux","year":"2001","journal-title":"The Concentration of Measure Phenomenon"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1561\/0100000092"},{"key":"ref78","author":"polyanskiy","year":"2017","journal-title":"Lecture Notes on Information Theory"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/18.720551"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3000635"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2170116"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2059891"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2184847"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2253852"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847700"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"2773","DOI":"10.1109\/18.737512","article-title":"An information-spectrum approach to capacity theorems for the general multiple-access channel","volume":"44","author":"han","year":"1998","journal-title":"IEEE Trans Inf Theory"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-9659(98)00013-5"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1966-007-2"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1965-034-2"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/18.412697"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159041"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2891664"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094817"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852290"},{"key":"ref66","first-page":"52","article-title":"A single-letter characterization of optimal noisy compressed sensing","author":"guo","year":"2009","journal-title":"Proc 47th Annu Allerton Conf Commun Control Comput (Allerton)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.802629"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483300"},{"key":"ref68","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S1076-5670(02)80018-0","article-title":"Low-density parity-check codes: Statistical physics perspective","volume":"125","author":"vicente","year":"2003","journal-title":"Advances in Imaging and Electron Physics"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1126\/science.264.5163.1297"},{"key":"ref2","author":"cover","year":"2012","journal-title":"Elements of Information Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849781"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174247"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032816"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2318726"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2184848"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2009.5470153"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0909892106"},{"key":"ref25","first-page":"wa4.7","article-title":"Outages, expected rates and delays in multiple-users fading channels","volume":"1","author":"bettesh","year":"2000","journal-title":"Proc Conf Inf Sci Syst"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252232"},{"key":"ref51","article-title":"Statistical physics and approximate message-passing algorithms for sparse linear estimation problems in signal processing and coding theory","author":"barbier","year":"2015","journal-title":"arXiv 1511 01650"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-274460-0.50022-9"},{"key":"ref58","author":"collins","year":"2016","journal-title":"SPECTRE short packet communication toolbox"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1186\/1029-242X-2012-61"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/18.259666"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261923"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/18.749007"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1142\/6300"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176994626"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849288"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006985"},{"key":"ref40","article-title":"Capacity-achieving spatially coupled sparse superposition codes with AMP decoding","author":"rush","year":"2020","journal-title":"arXiv 2002 07844"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8278023"},{"key":"ref13","article-title":"A coded compressed sensing scheme for uncoordinated multiple access","author":"amalladinne","year":"2018","journal-title":"arXiv 1809 04745"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01168-0_15"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437324"},{"key":"ref16","article-title":"CHIRRUP: A practical algorithm for unsourced multiple access","author":"calderbank","year":"2018","journal-title":"arXiv 1811 00879"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICC40277.2020.9148687"},{"key":"ref18","article-title":"Unsourced random access with coded compressed sensing: Integrating AMP and belief propagation","author":"amalladinne","year":"2020","journal-title":"arXiv 2010 04364"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849802"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006984"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2668391"},{"key":"ref6","article-title":"On the fundamental limits of MIMO massive multiple access channels","author":"wei","year":"2018","journal-title":"arXiv 1807 05553"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849764"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003824"},{"key":"ref7","article-title":"Information theoretic perspective on massive multiple-access","author":"polyanskiy","year":"2018","journal-title":"Short Course (Slides)"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2018.2876806"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513245"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177699450"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1214\/lnms\/1215090065"},{"key":"ref48","article-title":"Concise derivation of complex Bayesian approximate message passing via expectation propagation","author":"meng","year":"2015","journal-title":"arXiv 1509 08658"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2713833"},{"key":"ref44","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620483"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9523437\/9462926-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9523437\/09462926.pdf?arnumber=9462926","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:21Z","timestamp":1652194461000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9462926\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":78,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3091423","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9]]}}}