{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T21:20:21Z","timestamp":1680470421772},"reference-count":18,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2014,5,1]],"date-time":"2014-05-01T00:00:00Z","timestamp":1398902400000},"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,5]]},"DOI":"10.1109\/tit.2014.2307062","type":"journal-article","created":{"date-parts":[[2014,2,20]],"date-time":"2014-02-20T19:02:52Z","timestamp":1392922972000},"page":"2823-2834","source":"Crossref","is-referenced-by-count":1,"title":["Near-Optimal Rates for Limited-Delay Universal Lossy Source Coding"],"prefix":"10.1109","volume":"60","author":[{"given":"Andras","family":"Gyorgy","sequence":"first","affiliation":[]},{"given":"Gergely","family":"Neu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2004.1281479"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.885537"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2165815"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.917651"},{"key":"ref14","first-page":"132","article-title":"Regret minimization for online buffering problems using the weighted majority algorithm","author":"geulen","year":"0","journal-title":"Proc of the Annual Conf on Learning Theory (COLT)"},{"key":"ref15","first-page":"460","article-title":"Prediction by random-walk perturbation","volume":"30","author":"devroye","year":"0","journal-title":"Proc of the Annual Conf on Learning Theory (COLT)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.894660"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16108-7_22"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1009"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1556"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45435-7_6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.986015"},{"key":"ref8","first-page":"97","article-title":"Approximation to bayes risk in repeated plays","volume":"3","author":"hannan","year":"1957","journal-title":"Contributions to the Theory of Games"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2004.831128"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-146-8.50032-1"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.945263"},{"key":"ref9","first-page":"26","article-title":"Efficient algorithms for the online decision problem","author":"kalai","year":"0","journal-title":"Proc 16th Annu Conf Learning Theory and the 7th Kernel Workshop COLT-Kernel 2003"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6800061\/06746197.pdf?arnumber=6746197","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:29:53Z","timestamp":1642004993000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6746197\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5]]},"references-count":18,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2307062","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5]]}}}