{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:38:22Z","timestamp":1773376702730,"version":"3.50.1"},"reference-count":37,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"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":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619347","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"49-54","source":"Crossref","is-referenced-by-count":0,"title":["AIFV Codes Allowing 2-bit Decoding Delays for Unequal Bit Cost"],"prefix":"10.1109","author":[{"given":"Ken-Ichi","family":"Iwata","sequence":"first","affiliation":[{"name":"University of Fukui,Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kengo","family":"Hashimoto","sequence":"additional","affiliation":[{"name":"University of Fukui,Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takahiro","family":"Wakayama","sequence":"additional","affiliation":[{"name":"University of Fukui,Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hirosuke","family":"Yamamoto","sequence":"additional","affiliation":[{"name":"The University of Tokyo,Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2492961"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518105"},{"key":"ref3","article-title":"The Optimality of AIFV Codes in the Class of 2-bit Delay Decodable Codes","author":"Hashimoto","year":"2023","journal-title":"arXiv"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1961.1057615"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.705558"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.370161"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2002.1213"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2006.36"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/100794092"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834437"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2694017"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620529"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541050"},{"key":"ref16","first-page":"641","article-title":"A Dynamic Programming Algorithm to Construct Optimal Code Trees of AIFV Codes","volume-title":"Proc. Int. Symp. Inf. Theory and its Appl. (ISITA2016)","author":"Iwata","year":"2016"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006709"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8277992"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2799629"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437915"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437861"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.23919\/ISITA.2018.8664267"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/dcc.2019.00031"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849775"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849856"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/isit44484.2020.9173982"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174219"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ITW46852.2021.9457572"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.02.040"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834477"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3230745"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.2023tap0016"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3287587"},{"key":"ref34","article-title":"Optimal Construction of N -bit-delay Almost Instantaneous Fixed-to-Variable-Length Codes","author":"Sugiura","year":"2023","journal-title":"arXiv"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3314812"},{"key":"ref36","article-title":"The Markov-Chain Polytope with Applications","author":"Golin","year":"2024","journal-title":"arXiv"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"}],"event":{"name":"2024 IEEE International Symposium on Information Theory (ISIT)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10619013\/10619074\/10619347.pdf?arnumber=10619347","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:47Z","timestamp":1773347267000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619347\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619347","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}