{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:01:15Z","timestamp":1774990875900,"version":"3.50.1"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"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":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541050","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"6-10","source":"Crossref","is-referenced-by-count":3,"title":["Tight upper bounds on the redundancy of optimal binary AIFV codes"],"prefix":"10.1109","author":[{"given":"Weihua","family":"Hu","sequence":"first","affiliation":[{"name":"Dept. of Mathematical Eng., The University of Tokyo, Japan"}]},{"given":"Hirosuke","family":"Yamamoto","sequence":"additional","affiliation":[{"name":"Dept. of Complexity Sci. and Eng., The University of Tokyo, Japan"}]},{"given":"Junya","family":"Honda","sequence":"additional","affiliation":[{"name":"Dept. of Complexity Sci. and Eng., The University of Tokyo, Japan"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2492961"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620529"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"2132","DOI":"10.1109\/TIT.2002.1013158","article-title":"A simple upper bound on the redundancy of Huffman codes","volume":"48","author":"ye","year":"2002","journal-title":"IEEE Trans Inform Theory"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057266"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055959"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.42226"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.108260"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056158"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056818"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541050.pdf?arnumber=7541050","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:52:08Z","timestamp":1774986728000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541050\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541050","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}