{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T11:10:45Z","timestamp":1744888245566,"version":"3.37.3"},"reference-count":8,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,4,11]],"date-time":"2021-04-11T00:00:00Z","timestamp":1618099200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,4,11]],"date-time":"2021-04-11T00:00:00Z","timestamp":1618099200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,4,11]],"date-time":"2021-04-11T00:00:00Z","timestamp":1618099200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,4,11]]},"DOI":"10.1109\/itw46852.2021.9457572","type":"proceedings-article","created":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T20:31:13Z","timestamp":1624393873000},"page":"1-5","source":"Crossref","is-referenced-by-count":8,"title":["An Algorithm for Constructing the Optimal Code Trees for Binary Alphabetic AIFV-m Codes"],"prefix":"10.1109","author":[{"given":"Ken-ichi","family":"Iwata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hirosuke","family":"Yamamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1959.tb01583.x"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174219"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/0206045"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/0121057"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849856"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437915"},{"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":"2020 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2021,4,11]]},"location":"Riva del Garda, Italy","end":{"date-parts":[[2021,4,15]]}},"container-title":["2020 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9457568\/9457569\/09457572.pdf?arnumber=9457572","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:42:31Z","timestamp":1652197351000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9457572\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,11]]},"references-count":8,"URL":"https:\/\/doi.org\/10.1109\/itw46852.2021.9457572","relation":{},"subject":[],"published":{"date-parts":[[2021,4,11]]}}}