{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T07:59:14Z","timestamp":1767772754670,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006975","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T14:54:37Z","timestamp":1504018477000},"page":"2478-2482","source":"Crossref","is-referenced-by-count":8,"title":["The error exponent of sparse regression codes with AMP decoding"],"prefix":"10.1109","author":[{"given":"Cynthia","family":"Rush","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramji","family":"Venkataramanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","article-title":"Approximate iterative bayes optimal estimates for high-rate sparse superposition codes","author":"cho","year":"2013","journal-title":"Sixth Workshop on Inf> Theoretic Methods in Sci and Eng"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283048"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0909892106"},{"journal-title":"Approximate message-passing decoder and capacity-achieving sparse superposition codes","year":"2015","author":"barbier","key":"ref6"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094817"},{"journal-title":"High-dimensional regression with random design including sparse superposition codes","year":"2014","author":"cho","key":"ref5"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2616117"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541400"},{"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\/ISIT.2017.8006975"},{"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 on Inf Theory"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006975.pdf?arnumber=8006975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T18:20:45Z","timestamp":1570040445000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006975\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006975","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}