{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:06:45Z","timestamp":1755220005032,"version":"3.43.0"},"reference-count":7,"publisher":"IEEE","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"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":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437861","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"2187-2191","source":"Crossref","is-referenced-by-count":15,"title":["An Optimality Proof of the Iterative Algorithm for AIFV-m Codes"],"prefix":"10.1109","author":[{"given":"Ryusei","family":"Fujita","sequence":"first","affiliation":[{"name":"University of Fukui Fukui-shi, Fukui, 910-8507, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ken-Ichi","family":"Iwata","sequence":"additional","affiliation":[{"name":"University of Fukui Fukui-shi, Fukui, 910-8507, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hirosuke","family":"Yamamoto","sequence":"additional","affiliation":[{"name":"Meiji University Chiyoda-ku, Tokyo, 101-8301, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","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 App (ISITA)"},{"key":"ref3","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":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.705558"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.945241"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISITA.2010.5649220"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2694017"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2492961"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437861.pdf?arnumber=8437861","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T17:42:33Z","timestamp":1754588553000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437861\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":7,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437861","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}