{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:26Z","timestamp":1773377006901,"version":"3.50.1"},"reference-count":16,"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.11195631","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":["A Lower Bound of Worst-Case Redundancy of $k$-Symbol Delay Decodable Codes"],"prefix":"10.1109","author":[{"given":"Kengo","family":"Hashimoto","sequence":"first","affiliation":[{"name":"University of Fukui,Department of Information Science,Fukui,Japan"}]},{"given":"Ken-ichi","family":"Iwata","sequence":"additional","affiliation":[{"name":"University of Fukui,Department of Information Science,Fukui,Japan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3230745"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.2023TAP0016"},{"issue":"9","key":"ref3","first-page":"1098","article-title":"A Method for the Construction of MinimumRedundancy Codes","volume-title":"Proc. I.R.E.","volume":"40","author":"Huffman","year":"1952"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2694017"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3503717"},{"key":"ref6","first-page":"2355","article-title":"Worst-case Redundancy of Optimal Binary AIFV-m Codes for m=3,5","volume-title":"Proc.2020 IEEE Int. Symp. on Inform. Theory (ISIT2020)","author":"Fujita"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2492961"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3314812"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2025.3604725"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518105"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3265413"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1561\/0100000004"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1561\/0100000090"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/9781108565462"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2331954"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.272459"}],"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\/11195631.pdf?arnumber=11195631","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:58Z","timestamp":1773347398000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195631\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195631","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}