{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T17:35:54Z","timestamp":1761759354953,"version":"build-2065373602"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"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":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1109\/tit.2025.3604725","type":"journal-article","created":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T19:30:33Z","timestamp":1756755033000},"page":"8181-8205","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Construction of\n                    <i>N<\/i>\n                    -Bit-Delay Almost Instantaneous Fixed-to-Variable-Length Codes"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9464-2527","authenticated-orcid":false,"given":"Ryosuke","family":"Sugiura","sequence":"first","affiliation":[{"name":"NTT Communication Science Laboratories, Soraku-gun, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6489-5446","authenticated-orcid":false,"given":"Masaaki","family":"Nishino","sequence":"additional","affiliation":[{"name":"NTT Communication Science Laboratories, Soraku-gun, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Norihito","family":"Yasuda","sequence":"additional","affiliation":[{"name":"NTT Communication Science Laboratories, Soraku-gun, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6578-9178","authenticated-orcid":false,"given":"Yutaka","family":"Kamamoto","sequence":"additional","affiliation":[{"name":"NTT Communication Science Laboratories, Atsugi, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4591-1273","authenticated-orcid":false,"given":"Takehiro","family":"Moriya","sequence":"additional","affiliation":[{"name":"NTT Communication Science Laboratories, Soraku-gun, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1201\/9780203908440"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-903-9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/0470041978"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50204-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0935-6"},{"volume-title":"Introduction to Data Compression","year":"2006","author":"Sayood","key":"ref7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2492961"},{"key":"ref9","first-page":"641","article-title":"A dynamic programming algorithm to construct optimal code trees of AIFV codes","volume-title":"Proc. Int. Symp. Inf. Theory Appl. (ISITA)","author":"Iwata"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.02.040"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2694017"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8277992"},{"issue":"39","key":"ref13","first-page":"79","article-title":"A dynamic programming algorithm to construct optimal code trees of binary AIFV-m codes","volume-title":"IEICE Tech. Rep.","volume":"117","author":"Takaya","year":"2017"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174219"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3314812"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1090\/mbk\/107"},{"key":"ref17","first-page":"29","volume-title":"An Algorithm to Compute the Stochastically Stable Distribution of a Perturbed Markov Matrix","author":"Wicks","year":"2008"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849856"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977707"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3230745"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3503717"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.2023TAP0016"},{"key":"ref23","article-title":"Reduction of sufficient number of code tables of k-bit delay decodable codes","author":"Hashimoto","year":"2024","journal-title":"arXiv:2409.13287"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1961.1057615"},{"key":"ref25","first-page":"272","volume-title":"Applied Mathematical Programming","author":"Bradleya","year":"1977"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1002\/9780470400531.eorms1084"},{"issue":"205","key":"ref27","first-page":"19","article-title":"On searching for optimal non-alphabetic arithmetic codes based on A* algorithm","volume-title":"IEICE Tech. Rep.","volume":"118","author":"Uchida","year":"2018"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834477"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3287587"},{"volume-title":"Coding and Information Theory","year":"1980","author":"Hamming","key":"ref30"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1966.1053907"},{"key":"ref32","first-page":"1509","article-title":"Some practical universal noiseless coding techniques\u2014Part I-III","volume":"JPL-79-22","author":"Rice","year":"1991"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2799629"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.2020EAP1099"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2004.1326722"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/springerreference_205490"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1971.10"},{"key":"ref38","first-page":"615","volume-title":"Introduction to Algorithm","author":"Cormen","year":"2009"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11220181\/11146449.pdf?arnumber=11146449","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T17:33:19Z","timestamp":1761759199000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11146449\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":38,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2025.3604725","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2025,11]]}}}