{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:47Z","timestamp":1773377027735,"version":"3.50.1"},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"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":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195232","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Parse Forests with Huffman-Tree-Based Modes for One-Symbol-Delay Encodable VF Codes"],"prefix":"10.1109","author":[{"given":"Ryosuke","family":"Sugiura","sequence":"first","affiliation":[{"name":"NTT,Communication Science Labs.,Kyoto,Japan"}]},{"given":"Masaaki","family":"Nishino","sequence":"additional","affiliation":[{"name":"NTT,Communication Science Labs.,Kyoto,Japan"}]},{"given":"Norihito","family":"Yasuda","sequence":"additional","affiliation":[{"name":"NTT,Communication Science Labs.,Kyoto,Japan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-903-9"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0935-6"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-30038-4_92"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2011.01.005"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/tcsi.2023.3245022"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.945241"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437665"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2991314"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2014.10.005"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518050"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173982"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518033"},{"key":"ref14","first-page":"18","volume-title":"Synthesis of noiseless compression codes","author":"Tunstall","year":"1967"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2010.27"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2023.3314812"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2025.3604725"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619633"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195232.pdf?arnumber=11195232","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:09Z","timestamp":1773347409000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195232\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195232","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}