{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:09:42Z","timestamp":1729631382241,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1109\/itw.2013.6691313","type":"proceedings-article","created":{"date-parts":[[2014,1,3]],"date-time":"2014-01-03T19:15:08Z","timestamp":1388776508000},"page":"1-5","source":"Crossref","is-referenced-by-count":0,"title":["Sparse Regression codes: Recent results and future directions"],"prefix":"10.1109","author":[{"given":"Ramji","family":"Venkataramanan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sekhar","family":"Tatikonda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056659"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620456"},{"journal-title":"Network Information Theory","year":"2012","author":"gamal","key":"17"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055508"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/18.75242"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/18.567644"},{"journal-title":"Information Theory and Reliable Communication","year":"1968","author":"gallager","key":"13"},{"journal-title":"Achieving information-theoretic limits with high-dimensional regression","year":"2012","author":"joseph","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620413"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483463"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283048"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040961"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"10","article-title":"Gaussian ratedistortion via sparse linear regression over compact dictionaries","author":"venkataramanan","year":"0","journal-title":"2012 IEEE Int Symp on Inf Theory"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513330"},{"key":"6","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"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284229"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503220"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503192"},{"key":"8","article-title":"Fast sparse superposition codes have exponentially small error probability for r < c","author":"joseph","year":"2012","journal-title":"IEEE Trans Inf Theory"}],"event":{"name":"2013 IEEE Information Theory Workshop (ITW 2013)","start":{"date-parts":[[2013,9,9]]},"location":"Sevilla, Spain","end":{"date-parts":[[2013,9,13]]}},"container-title":["2013 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6683945\/6691210\/06691313.pdf?arnumber=6691313","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T05:15:05Z","timestamp":1498108505000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6691313\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/itw.2013.6691313","relation":{},"subject":[],"published":{"date-parts":[[2013,9]]}}}