{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T19:52:27Z","timestamp":1694634747122},"reference-count":18,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T00:00:00Z","timestamp":1228089600000},"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":[[2008,12]]},"DOI":"10.1109\/tit.2008.2006387","type":"journal-article","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T16:30:00Z","timestamp":1228149000000},"page":"5563-5574","source":"Crossref","is-referenced-by-count":0,"title":["Universal Lossless Compression of Erased Symbols"],"prefix":"10.1109","volume":"54","author":[{"given":"Jiming","family":"Yu","sequence":"first","affiliation":[]},{"given":"Sergio","family":"Verdu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262010"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2008117"},{"key":"ref12","author":"willems","year":"1997","journal-title":"Complexity reduction of the Context-Tree Weighting Algorithm A Study for KPN Research"},{"key":"ref13","author":"volf","year":"2002","journal-title":"Weighting techniques in data compression theory and algorithm"},{"key":"ref14","author":"yu","year":"2007","journal-title":"Bidirectional Modeling of Finite-Alphabet Sources"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-40-00602-0"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055349"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/5.286191"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.661520"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.641559"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.661523"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.929968"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.650988"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055356"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.382012"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.880020"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056331"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/4675712\/04675745.pdf?arnumber=4675745","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T15:47:24Z","timestamp":1638200844000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4675745\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12]]},"references-count":18,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2008.2006387","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2008,12]]}}}