{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T15:04:37Z","timestamp":1730214277251,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/dcc.2004.1281482","type":"proceedings-article","created":{"date-parts":[[2004,6,10]],"date-time":"2004-06-10T14:19:45Z","timestamp":1086877185000},"page":"372-381","source":"Crossref","is-referenced-by-count":1,"title":["Linear time universal coding of tree sources via FSM closure"],"prefix":"10.1109","author":[{"given":"A.","family":"Martin","sequence":"first","affiliation":[]},{"given":"G.","family":"Seroussi","sequence":"additional","affiliation":[]},{"given":"M.J.","family":"Weinberger","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","article-title":"Context-tree maximizing","author":"willems","year":"2000","journal-title":"Proc 2000 Conf Information Sciences and Systems"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054929"},{"journal-title":"The art of computer programming","year":"1997","author":"knuth","key":"17"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.830763"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.1998.672147"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056282"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176350051"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009177"},{"key":"11","article-title":"A block-sorting lossless data compression algorithm","volume":"124","author":"burrows","year":"1994","journal-title":"SRC Res Report"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/5.892706"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/18.995542"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/18.135641"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056331"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/18.382011"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056741"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1984.1096090"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056936"},{"key":"6","first-page":"173","article-title":"Twice-universal coding","volume":"20","author":"ryabko","year":"1984","journal-title":"Problems of Information Transmission"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/18.661523"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/18.382012"},{"key":"9","article-title":"An O(n) semi-predictive universal encoder via the BWT","author":"baron","year":"0","journal-title":"IEEE Trans Inform Theory"},{"journal-title":"Some topics in descriptive complexity","year":"1994","author":"nohre","key":"8"}],"event":{"name":"Data Compression Conference, 2004. DCC 2004","location":"Snowbird, UT, USA"},"container-title":["Data Compression Conference, 2004. Proceedings. DCC 2004"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9014\/28614\/01281482.pdf?arnumber=1281482","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T02:18:54Z","timestamp":1489544334000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1281482\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/dcc.2004.1281482","relation":{},"subject":[]}}