{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T16:24:50Z","timestamp":1774023890506,"version":"3.50.1"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2014,2,1]],"date-time":"2014-02-01T00:00:00Z","timestamp":1391212800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1109\/tit.2013.2289865","type":"journal-article","created":{"date-parts":[[2013,11,19]],"date-time":"2013-11-19T18:51:34Z","timestamp":1384887094000},"page":"919-942","source":"Crossref","is-referenced-by-count":71,"title":["Fast Sparse Superposition Codes Have Near Exponential Error Probability for &lt;formula formulatype=\"inline\"&gt;&lt;tex Notation=\"TeX\"&gt;$R&amp;lt;{\\cal C}$&lt;\/tex&gt;&lt;\/formula&gt;"],"prefix":"10.1109","volume":"60","author":[{"given":"Antony","family":"Joseph","sequence":"first","affiliation":[]},{"given":"Andrew R.","family":"Barron","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864420"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834793"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2253852"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.1993.342465"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/78.258082"},{"key":"ref37","first-page":"267","article-title":"Regression shrinkage and selection via the lasso","volume":"58","author":"tibshirani","year":"1996","journal-title":"J R Statist Soc Ser B Statist Methodol"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/584091.584093"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2184848"},{"key":"ref34","article-title":"Fundamental tradeoffs for sparsity pattern recovery","author":"reeves","year":"2010","journal-title":"Inf Transf Manag"},{"key":"ref10","author":"barron","year":"2011","journal-title":"Sparse superposition codes are fast and reliable at rates approaching capacity with Gaussian noise"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909108"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094817"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2174612"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"2145","DOI":"10.1214\/08-AOS653","article-title":"Near-ideal model selection by <formula formulatype=\"inline\"> <tex Notation=\"TeX\">${\\mathl_{}}_{1}$<\/tex><\/formula> minimization","volume":"37","author":"cand\ufffds","year":"2009","journal-title":"Ann Statist"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450037906X"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054727"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993227"},{"key":"ref19","first-page":"169","article-title":"A sparsity detection framework for on-off random access channels","author":"fletcher","year":"2009","journal-title":"Proc IEEE ISIT"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503192"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205856"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2184847"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283048"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/18.556601"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.256500"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513330"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/009053607000000631"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034796"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033853"},{"key":"ref1","first-page":"194","article-title":"Polar codes for the AWGN","author":"abbe","year":"2011","journal-title":"Proc IEEE ISIT"},{"key":"ref46","author":"zhang","year":"2008","journal-title":"Adaptive Forward-Backward Greedy Algorithm for Sparse Learning with Linear Models"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2176936"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS729"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref47","first-page":"2541","article-title":"On model selection consistency of lasso","volume":"7","author":"zhao","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref21","author":"david","year":"1965","journal-title":"Concatenated Codes"},{"key":"ref42","author":"venkataramanan","year":"2012","journal-title":"Lossy compression via sparse linear regression Computationally efficient encoding and decoding"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176348546"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284210"},{"key":"ref23","author":"huang","year":"2008","journal-title":"Risk of Penalized Least Squares Greedy Selection and Penalization for Flexible Function Libraries"},{"key":"ref44","doi-asserted-by":"crossref","first-page":"2183","DOI":"10.1109\/TIT.2009.2016018","article-title":"Sharp thresholds for high-dimensional and noisy sparsity recovery using <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\ell_{1}$<\/tex> <\/formula>-constrained quadratic programming (Lasso)","volume":"55","author":"wainwright","year":"2009","journal-title":"IEEE Trans Inf Theory"},{"key":"ref26","first-page":"1771","article-title":"Variable selection in high dimensions with random designs and orthogonal matching pursuit","author":"joseph","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032816"},{"key":"ref25","author":"joseph","year":"2012","journal-title":"Achieving information-theoretic limits with high-dimensional regression"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6714461\/06657788.pdf?arnumber=6657788","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:31:37Z","timestamp":1642005097000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6657788\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2]]},"references-count":47,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2289865","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2]]}}}