{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T06:27:21Z","timestamp":1761719241836,"version":"build-2065373602"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"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":[[2023,12]]},"DOI":"10.1109\/tit.2023.3314812","type":"journal-article","created":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T13:32:38Z","timestamp":1694611958000},"page":"7672-7690","source":"Crossref","is-referenced-by-count":6,"title":["General Form of Almost Instantaneous Fixed-to-Variable-Length Codes"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9464-2527","authenticated-orcid":false,"given":"Ryosuke","family":"Sugiura","sequence":"first","affiliation":[{"name":"NTT Communication Science Laboratories, NTT Corporation, Kyoto, 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, NTT Corporation, Kyoto, 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, NTT Corporation, Kyoto, 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"},{"article-title":"SHORTEN: Simple lossless and near-lossless waveform compression","year":"1994","author":"Robinson","key":"ref5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7179068"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0935-6"},{"volume-title":"Introduction to Data Compression","year":"2006","author":"Sayood","key":"ref9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2492961"},{"key":"ref11","first-page":"641","article-title":"A dynamic programming algorithm to construct optimal code trees of AIFV codes","volume-title":"Proc. Int. Symp. Inf. Theory Its Appl. (ISITA)","author":"Iwata"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.02.040"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2694017"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8277992"},{"key":"ref15","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":"Kawai","year":"2017"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174219"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2799629"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.2020EAP1099"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1090\/mbk\/107"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3230745"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437861"},{"key":"ref22","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"},{"article-title":"On searching for optimal non-alphabetic arithmetic codes with low delay based on A* algorithm","volume-title":"IEEE Int. Symp. Inf. Theory (ISIT)","author":"Uchida","key":"ref23"},{"key":"ref24","first-page":"56","article-title":"On the optimality of the AIFV code for average codeword length","volume":"120","author":"Hashimoto","year":"2020"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518105"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.2023TAP0016"},{"key":"ref27","article-title":"The optimality of AIFV codes in the class of 2-bit delay decodable codes","author":"Hashimoto","year":"2023","journal-title":"arXiv:2306.09671"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849856"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10328924\/10250882.pdf?arnumber=10250882","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T17:57:24Z","timestamp":1761587844000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10250882\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12]]},"references-count":28,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3314812","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2023,12]]}}}