{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:51:51Z","timestamp":1730274711059,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523767","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:51:59Z","timestamp":1160581919000},"page":"2345-2348","source":"Crossref","is-referenced-by-count":0,"title":["Bayes universal coding algorithm for side information context tree models"],"prefix":"10.1109","author":[{"given":"T.","family":"Matsushima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Hirasawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1995.535781"},{"journal-title":"Universal Data Compression Algorithms for Stationary Ergodic Sources Based on the Complexity of Sequences","year":"1998","author":"muramatsu","key":"2"},{"key":"10","first-page":"2123","article-title":"A generalization of B.S.Clarke and A. R. Barron' s asymptotics of Bayes codes for FSMX sources","volume":"e81 a","author":"gotoh","year":"1998","journal-title":"IEICE Trans Fundamentals"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056878"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/18.382012"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/18.54897"},{"key":"5","first-page":"95","article-title":"Asymptotic optimality for universal data compression algorithm with side information based onIncrementParsing","volume":"j85 a","author":"uematsu","year":"2002","journal-title":"IEICE A"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/18.945239"},{"key":"9","first-page":"388","article-title":"A Bayes coding algorithm for FSMX sorces","author":"matsushima","year":"1995","journal-title":"Proc IEEE Int Symp on Information Theory"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/18.133247"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"}],"event":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","start":{"date-parts":[[2005,9,4]]},"location":"Adelaide, Australia","end":{"date-parts":[[2005,9,9]]}},"container-title":["Proceedings. International Symposium on Information Theory, 2005. ISIT 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10215\/32581\/01523767.pdf?arnumber=1523767","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T01:33:42Z","timestamp":1489628022000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523767\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523767","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}