{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:57:19Z","timestamp":1773377839663,"version":"3.50.1"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849856","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"1902-1906","source":"Crossref","is-referenced-by-count":19,"title":["An Iterative Algorithm to Optimize the Average Performance of Markov Chains with Finite States"],"prefix":"10.1109","author":[{"given":"Ryusei","family":"Fujita","sequence":"first","affiliation":[{"name":"University of Fukui"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ken-ichi","family":"Iwata","sequence":"additional","affiliation":[{"name":"University of Fukui"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hirosuke","family":"Yamamoto","sequence":"additional","affiliation":[{"name":"The University of Tokyo"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","author":"mitzenmacher","year":"2017","journal-title":"Probability and Computing Randomization and Probabilistic Techniques in Algorithms and Data Analysis"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437861"},{"key":"ref10","article-title":"Solution of state equation","author":"kawabata","year":"0"},{"key":"ref6","first-page":"641","article-title":"A Dynamic Programming Algorithm to Construct Optimal Code Trees of AIFV Codes","author":"iwata","year":"2016","journal-title":"Proc Int Symp Inf Theory and its Appl (ISITA)"},{"key":"ref5","first-page":"519","article-title":"An Iterative Algorithm to Construct Optimal Binary AIFV-m Codes","author":"iwata","year":"2017","journal-title":"Proc IEEE Inf Theory Workshop (ITW)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437665"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.945241"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2492961"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2019.00031"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2694017"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849856.pdf?arnumber=8849856","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:19Z","timestamp":1773347719000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849856\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849856","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}