{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T18:19:04Z","timestamp":1785953944003,"version":"3.56.0"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100000783","name":"Marie Curie Career Integration Grant","doi-asserted-by":"publisher","award":["631489"],"award-info":[{"award-number":["631489"]}],"id":[{"id":"10.13039\/501100000783","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"EPSRC Doctoral Training 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 Trans. Inform. Theory"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1109\/tit.2017.2649460","type":"journal-article","created":{"date-parts":[[2017,1,9]],"date-time":"2017-01-09T21:42:12Z","timestamp":1483998132000},"page":"1476-1500","source":"Crossref","is-referenced-by-count":93,"title":["Capacity-Achieving Sparse Superposition Codes via Approximate Message Passing Decoding"],"prefix":"10.1109","volume":"63","author":[{"given":"Cynthia","family":"Rush","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7290-4063","authenticated-orcid":false,"given":"Adam","family":"Greig","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7915-5432","authenticated-orcid":false,"given":"Ramji","family":"Venkataramanan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2012\/08\/P08009"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033942"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2274513"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.914731"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864420"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2309005"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2011.2169232"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2191780"},{"key":"ref28","year":"2017","journal-title":"Extended Proof of Steps 2(b) and 4(b)"},{"key":"ref4","article-title":"High-dimensional regression with random design, including sparse superposition codes","author":"cho","year":"2014"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1969.222685"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283048"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503193"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0909892106"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794308.010"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094817"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2289865"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2174612"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"2541","DOI":"10.1109\/TIT.2012.2184847","article-title":"Least squares superposition codes of moderate dictionary size are reliable at rates up to capacity","volume":"58","author":"barron","year":"2012","journal-title":"IEEE Trans Inf Theory"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-013-1862-3"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875082"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iat004"},{"key":"ref24","author":"guill\u00e9n i f\u00e0bregas","year":"2008","journal-title":"Bit-Interleaved Coded Modulation"},{"key":"ref23","article-title":"Approximate message-passing decoder and capacity-achieving sparse superposition codes","author":"barbier","year":"2015"},{"key":"ref26","article-title":"Construction of capacity-achieving lattice codes: Polar lattices","author":"yan","year":"2014"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.917684"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7855839\/07809025.pdf?arnumber=7809025","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:13:38Z","timestamp":1642004018000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7809025\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3]]},"references-count":28,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2649460","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3]]}}}