{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:17:16Z","timestamp":1761293836613,"version":"3.37.3"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"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","doi-asserted-by":"publisher","award":["EP\/N013999\/1"],"award-info":[{"award-number":["EP\/N013999\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004815","name":"Isaac Newton Trust","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004815","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Marie Curie Career Integration Grant","award":["631489"],"award-info":[{"award-number":["631489"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1109\/tit.2018.2882177","type":"journal-article","created":{"date-parts":[[2018,11,19]],"date-time":"2018-11-19T19:40:40Z","timestamp":1542656440000},"page":"3278-3303","source":"Crossref","is-referenced-by-count":16,"title":["The Error Probability of Sparse Superposition Codes With Approximate Message Passing Decoding"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6857-2855","authenticated-orcid":false,"given":"Cynthia","family":"Rush","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7915-5432","authenticated-orcid":false,"given":"Ramji","family":"Venkataramanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.840887"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0909892106"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794308.010"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094817"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033942"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2012\/08\/P08009"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283056"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875223"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282733"},{"journal-title":"Estimation of low-rank matrices via approximate message passing","year":"2017","author":"montanari","key":"ref19"},{"key":"ref4","first-page":"1","article-title":"Approximate iterative Bayes optimal estimates for high-rate sparse superposition codes","author":"cho","year":"2013","journal-title":"Proc 6th Workshop Inf Theoretic Methods Sci Eng"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283048"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875082"},{"article-title":"High-dimensional regression with random design, including sparse superposition codes","year":"2014","author":"cho","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2713833"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2649460"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2289865"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1013125"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2184847"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2816681"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2016.7606799"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541484"},{"key":"ref24","volume":"2","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2776937"},{"article-title":"Achieving information-theoretic limits with high-dimensional regression","year":"2012","author":"joseph","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2371819"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8694135\/08540415.pdf?arnumber=8540415","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:09:17Z","timestamp":1657746557000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8540415\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":27,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2882177","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2019,5]]}}}