{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T18:10:04Z","timestamp":1729966204692,"version":"3.28.0"},"reference-count":12,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2024,3,1]]},"DOI":"10.1587\/transfun.2023tap0017","type":"journal-article","created":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T22:55:39Z","timestamp":1692831339000},"page":"448-457","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Bayes Coding Algorithm for Changing Context Tree Model"],"prefix":"10.1587","volume":"E107.A","author":[{"given":"Koshi","family":"SHIMADA","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics, School of Fundamental Science and Engineering, Waseda University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shota","family":"SAITO","sequence":"additional","affiliation":[{"name":"Faculty of Informatics, Gunma University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiyasu","family":"MATSUSHIMA","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics, School of Fundamental Science and Engineering, Waseda University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] F.M.J. Willems, Y.M. Shtarkov, and T.J. Tjalkens, \u201cThe context-tree weighting method: Basic properties,\u201d IEEE Trans. Inf. Theory, vol.41, no.3, pp.653-664, May 1995, DOI: 10.1109\/18.382012. 10.1109\/18.382012","DOI":"10.1109\/18.382012"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] G.I. Shamir and N. Merhav, \u201cLow-complexity sequential lossless coding for piecewise-stationary memoryless sources,\u201d IEEE Trans. Inf. Theory, vol.45, no.5, pp.1498-1519, July 1999, DOI: 10.1109\/18.771150. 10.1109\/18.771150","DOI":"10.1109\/18.771150"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] K. Shimada, S. Saito, and T. Matsushima, \u201cAn efficient Bayes coding algorithm for the non-stationary source in which context tree model varies from interval to interval,\u201d 2021 IEEE Information Theory Workshop (ITW), pp.1-6, 2021, DOI: 10.1109\/ITW48936.2021.9611430. 10.1109\/itw48936.2021.9611430","DOI":"10.1109\/ITW48936.2021.9611430"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] M. Duc Cao, T.I. Dix, L. Allison, and C. Mears, \u201cA simple statistical algorithm for biological sequence compression,\u201d 2007 Data Compression Conference (DCC'07), pp.43-52, 2007, DOI: 10.1109\/DCC.2007.7. 10.1109\/dcc.2007.7","DOI":"10.1109\/DCC.2007.7"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] N. Merhav, \u201cOn the minimum description length principle for sources with piecewise constant parameters,\u201d IEEE Trans. Inf. Theory, vol.39, no.6, pp.1962-1967, Nov. 1993, DOI: 10.1109\/18.265504. 10.1109\/18.265504","DOI":"10.1109\/18.265504"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] T. Matsushima, H. Inazumi, and S. Hirasawa, \u201cA class of distortionless codes designed by Bayes decision theory,\u201d IEEE Trans. Inf. Theory, vol.37, no.5, pp.1288-1293, Sept. 1991, DOI: 10.1109\/18.133247. 10.1109\/18.133247","DOI":"10.1109\/18.133247"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] T. Matsushima and S. Hirasawa, \u201cA Bayes coding algorithm using context tree,\u201d Proc. 1994 IEEE International Symposium on Information Theory, p.386, 1994. 10.1109\/isit.1994.394633","DOI":"10.1109\/ISIT.1994.394633"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] T. Matsushima and S. Hirasawa, \u201cA class of prior distributions on context tree models and an efficient algorithm of the Bayes codes assuming it,\u201d 2007 IEEE International Symposium on Signal Processing and Information Technology, Giza, pp.938-941, 2007, DOI: 10.1109\/ISSPIT.2007.4458049. 10.1109\/isspit.2007.4458049","DOI":"10.1109\/ISSPIT.2007.4458049"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] T. Matsushima and S. Hirasawa, \u201cReducing the space complexity of a Bayes coding algorithm using an expanded context tree,\u201d 2009 IEEE International Symposium on Information Theory, pp.719-723, June 2009. 10.1109\/isit.2009.5205677","DOI":"10.1109\/ISIT.2009.5205677"},{"key":"10","unstructured":"[10] T. Suko, T. Matsushima, and S. Hirasawa, \u201cBayes coding for sources with piecewise constant parameters,\u201d Proc. 26th Symposium on Information Theory and Its Applications, pp.165-168, 2003 (in Japanese)."},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] Y. Nakahara, S. Saito, A. Kamatsuka, and T. Matsushima, \u201cProbability distribution on rooted trees,\u201d 2022 IEEE International Symposium on Information Theory (ISIT), pp.174-179, 2022, DOI:10.1109\/ISIT50566.2022.9834481. 10.1109\/isit50566.2022.9834481","DOI":"10.1109\/ISIT50566.2022.9834481"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] Y. Nakahara, S. Saito, A. Kamatsuka, and T. Matsushima, \u201cProbability distribution on full rooted trees,\u201d Entropy, vol.24, no.3, p.328, 2022. [Online]. Available: https:\/\/www.mdpi.com\/1099-4300\/24\/3\/328","DOI":"10.3390\/e24030328"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E107.A\/3\/E107.A_2023TAP0017\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T17:45:44Z","timestamp":1729964744000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E107.A\/3\/E107.A_2023TAP0017\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,1]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2023tap0017","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"type":"print","value":"0916-8508"},{"type":"electronic","value":"1745-1337"}],"subject":[],"published":{"date-parts":[[2024,3,1]]},"article-number":"2023TAP0017"}}