{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T10:06:49Z","timestamp":1730196409766,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1109\/allerton.2013.6736709","type":"proceedings-article","created":{"date-parts":[[2014,2,13]],"date-time":"2014-02-13T22:46:12Z","timestamp":1392331572000},"page":"1531-1536","source":"Crossref","is-referenced-by-count":1,"title":["Complexity and rate-distortion tradeoff via successive refinement"],"prefix":"10.1109","author":[{"given":"Albert","family":"No","sequence":"first","affiliation":[]},{"given":"Amir","family":"Ingber","sequence":"additional","affiliation":[]},{"given":"Tsachy","family":"Weissman","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","article-title":"Lossy compression via sparse linear regression: Computationally efficient encoding and decoding","author":"venkataramanan","year":"2012","journal-title":"ArXiv Preprint arXiv 1212 1707v1"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.806142"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284210"},{"key":"15","article-title":"Successive refinement of information: Characterization of the achievable rates","volume":"40","author":"rimoldi","year":"2005","journal-title":"IEEE Transactions on Information Theory"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1112\/S0025579300004083"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2186786"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055204"},{"key":"11","first-page":"20","article-title":"Estimation of mean error for a discrete successive approximation scheme","volume":"17","author":"koshe?lev","year":"1981","journal-title":"Problemy Peredachi Informatsii"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040961"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-004-2916-2"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513318"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483463"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946012040072"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"1"},{"key":"10","first-page":"3149","article-title":"Hierarchical coding of discrete sources","volume":"16","author":"koshe?lev","year":"1980","journal-title":"Problemy Peredachi Informatsii"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2011.13"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595106"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/18.75242"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/18.481803"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120166"}],"event":{"name":"2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2013,10,2]]},"location":"Monticello, IL","end":{"date-parts":[[2013,10,4]]}},"container-title":["2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6725831\/6736491\/06736709.pdf?arnumber=6736709","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T17:34:16Z","timestamp":1490290456000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6736709\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/allerton.2013.6736709","relation":{},"subject":[],"published":{"date-parts":[[2013,10]]}}}