{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:08Z","timestamp":1773377768728,"version":"3.50.1"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834341","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2874-2879","source":"Crossref","is-referenced-by-count":5,"title":["Improved Bounds for the Many-User MAC"],"prefix":"10.1109","author":[{"given":"Suhas S","family":"Kowshik","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology,Dept. of EECS,Cambridge,MA,USA"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2274513"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2352296"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3136437"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2713833"},{"key":"ref34","article-title":"Spatially Coupled Sparse Regression Codes for Single-and Multi-user Communications","author":"hsieh","year":"2021","journal-title":"Ph D Dissertation"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3081189"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3065291"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC51858.2021.9593201"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICC40277.2020.9148687"},{"key":"ref14","first-page":"1","article-title":"LDPC Codes with Soft Interference Cancellation for Uncoordinated Unsourced Multiple Access","author":"pradhan","year":"2021","journal-title":"ICC 2021 - IEEE Int Conf Commun"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3158827"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.3390\/e23050539"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2059891"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2170116"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"18 914","DOI":"10.1073\/pnas.0909892106","article-title":"Message-passing algorithms for compressed sensing","volume":"106","author":"donoho","year":"2009","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"ref28","article-title":"Statistical physics and approximate message-passing algorithms for sparse linear estimation problems in signal processing and coding theory","author":"barbier","year":"2015"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849764"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2184847"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006984"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3000635"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875082"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3091423"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3012948"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006985"},{"key":"ref2","article-title":"White paper on critical and massive machine type communication towards 6g","author":"mahmood","year":"2020"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.3390\/s22020676","article-title":"An Enhanced Decoding Algorithm for Coded Compressed Sensing with Applications to Unsourced Random Access","volume":"22","author":"amalladinne","year":"2022","journal-title":"SENSORS"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3019724"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094817"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2934152"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iat004"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2816681"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iay021"},{"key":"ref26","article-title":"Graph-based approximate message passing iterations","author":"gerbelot","year":"2021"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3083733"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834341.pdf?arnumber=9834341","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\/9834341\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834341","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}