{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:51:02Z","timestamp":1774680662458,"version":"3.50.1"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1017744"],"award-info":[{"award-number":["CCF-1017744"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1217023"],"award-info":[{"award-number":["CCF-1217023"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/tit.2014.2314676","type":"journal-article","created":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T14:02:18Z","timestamp":1396360938000},"page":"3265-3278","source":"Crossref","is-referenced-by-count":20,"title":["Lossy Compression via Sparse Linear Regression: Computationally Efficient Encoding and Decoding"],"prefix":"10.1109","volume":"60","author":[{"given":"Ramji","family":"Venkataramanan","sequence":"first","affiliation":[]},{"given":"Tuhin","family":"Sarkar","sequence":"additional","affiliation":[]},{"given":"Sekhar","family":"Tatikonda","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054193"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2006.322832"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2186786"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620456"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094817"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016018"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.567644"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(69)90403-3"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1970.1054394"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.75242"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.272493"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483463"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595106"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ITWNIT.2009.5158578"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595107"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016040"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054145"},{"key":"ref4","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":"ref27","doi-asserted-by":"crossref","DOI":"10.1002\/0471722162","author":"david","year":"2003","journal-title":"Order Statistics"},{"key":"ref3","first-page":"1891","article-title":"Error exponent for coding of memoryless Gaussian sources with a fidelity criterion","volume":"e83 a","author":"ihara","year":"2000","journal-title":"IEICE Trans Fundam"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/78.258082"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2011.13"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2289865"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503192"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/009053607000000631"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055204"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284210"},{"key":"ref1","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2039160"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.720541"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040961"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/18.179341"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056484"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003821"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.804056"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6816018\/06781602.pdf?arnumber=6781602","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:56:17Z","timestamp":1641988577000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6781602\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":37,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2314676","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6]]}}}