{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T01:58:25Z","timestamp":1775181505868,"version":"3.50.1"},"reference-count":37,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"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":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206691","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"785-790","source":"Crossref","is-referenced-by-count":5,"title":["Capacity-Achieving Sparse Regression Codes via Vector Approximate Message Passing"],"prefix":"10.1109","author":[{"given":"Yizhou","family":"Xu","sequence":"first","affiliation":[{"name":"Tsinghua University,School of Aerospace Engineering,Beijing,China"}]},{"given":"YuHao","family":"Liu","sequence":"additional","affiliation":[{"name":"Tsinghua University,Department of Mathematical Sciences,Beijing,China"}]},{"given":"ShanSuo","family":"Liang","sequence":"additional","affiliation":[{"name":"Huawei Technologies Co., Ltd.,Theory Lab, Central Research Institute, 2012 Labs"}]},{"given":"Tingyi","family":"Wu","sequence":"additional","affiliation":[{"name":"Huawei Technologies Co., Ltd.,Theory Lab, Central Research Institute, 2012 Labs"}]},{"given":"Bo","family":"Bai","sequence":"additional","affiliation":[{"name":"Huawei Technologies Co., Ltd.,Theory Lab, Central Research Institute, 2012 Labs"}]},{"given":"Jean","family":"Barbier","sequence":"additional","affiliation":[{"name":"Tsinghua University,School of Aerospace Engineering,Beijing,China"}]},{"given":"TianQi","family":"Hou","sequence":"additional","affiliation":[{"name":"Huawei Technologies Co., Ltd.,Theory Lab, Central Research Institute, 2012 Labs"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3083733"},{"key":"ref35","article-title":"Spatially coupled sparse regression codes for single-and multi-user communications","author":"hsieh","year":"2021","journal-title":"PhD thesis University of Cambridge"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006798"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3158827"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2913109"},{"key":"ref37","article-title":"A non-asymptotic framework for approximate message passing in spiked models","author":"li","year":"2022","journal-title":"arXiv preprint arXiv 2208 09610"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2776937"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518275"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174035"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849802"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541484"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3136437"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2882177"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173954"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/26.539767"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1561\/0100000092"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006578"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2016.7606840"},{"key":"ref19","article-title":"A non-asymptotic analysis of generalized approximate message passing algorithms with right rota¬tionally invariant designs","author":"cademartori","year":"2023"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2916359"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1561\/0100000001"},{"key":"ref23","article-title":"Plug-in estimation in high-dimensional linear inverse problems: A rigorous analysis","volume":"31","author":"fletcher","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref26","article-title":"Sparse superpo¬sition codes with rotational invariant coding matrices for memoryless channels","author":"liu","year":"2022"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206691"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.2020EAL2053"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094817"},{"key":"ref21","article-title":"Sparse superposi¬tion codes under vamp decoding with generic rotational invariant coding matrices","author":"hou","year":"2022"},{"key":"ref28","article-title":"Spectral universality of regularized linear regression with nearly deterministic sensing matrices","author":"dudeja","year":"2022","journal-title":"arXiv preprint arXiv 2208 02403"},{"key":"ref27","article-title":"Universality of approximate message passing with semi-randommatrices","author":"dudeja","year":"2022","journal-title":"arXiv preprint arXiv 2204 04281"},{"key":"ref29","article-title":"Long-memory message-passing for spatially coupled systems","author":"takeuchi","year":"2022","journal-title":"arXiv preprint arXiv 2210 06755"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2713833"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283048"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2649460"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2289865"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2184847"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206691.pdf?arnumber=10206691","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:27Z","timestamp":1773347247000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206691\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206691","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}