{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:17Z","timestamp":1773377777497,"version":"3.50.1"},"reference-count":38,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834437","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"3327-3332","source":"Crossref","is-referenced-by-count":2,"title":["Joint Coding for Discrete Sources and Finite-State Noiseless Channels"],"prefix":"10.1109","author":[{"given":"Ken-Ichi","family":"Iwata","sequence":"first","affiliation":[{"name":"University of Fukui"}]},{"given":"Hirosuke","family":"Yamamoto","sequence":"additional","affiliation":[{"name":"The University of Tokyo"}]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518033"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2492961"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437861"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849856"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ITW46852.2021.9457572"},{"key":"ref36","first-page":"641","article-title":"A Dynamic Programming Algorithm to Construct Optimal Code Trees of AIFV Codes","author":"iwata","year":"2016","journal-title":"Proc Int Symp Inf Theory and its Appl (ISITA)"},{"key":"ref35","first-page":"519","article-title":"An Iterative Algorithm to Construct Optimal Binary AIFV-m Codes","author":"iwata","year":"2017","journal-title":"Proc IEEE Inf Theory Workshop (ITW)"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2019.00031"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055092"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"},{"key":"ref13","first-page":"2232","article-title":"An Efficient Universal Coding Algorithm for Noiseless Channel with Symbols of Uneqaul Cost","volume":"e80 a","author":"iwata","year":"1997","journal-title":"IEICE Trans Fundamentals"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1961.1057615"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.705558"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.370161"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2002.1213"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2006.36"},{"key":"ref28","author":"marcus","year":"2001","journal-title":"An Introduction to Coding for Constrained Systems (Lecture Notes)"},{"key":"ref4","first-page":"1300","article-title":"Universal Data Compression Considering Cost for Codeword","author":"uyematsu","year":"2000","journal-title":"IEICE Trans Fundamentals"},{"key":"ref27","author":"immink","year":"2004","journal-title":"Codes for Mass Data Storage Systems"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.850666"},{"key":"ref6","author":"jelinek","year":"1968","journal-title":"Probabilistic Information Theory"},{"key":"ref29","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISITA.2010.5649220"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056143"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(62)90183-3"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.272459"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1147\/rd.282.0135"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(69)90084-9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/100794092"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2986318"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2014.11.013"},{"key":"ref24","first-page":"648","article-title":"On Minimum Expected Length Prefix Codes Satisfying a (dk) Runlength-Limited Constraint","author":"manickam","year":"2018","journal-title":"Proc Int Symp Inf Theory and its Appl (ISITA)"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"4372","DOI":"10.1109\/20.799088","article-title":"Combined Source\/Channel Coding and a New Coding Scheme for Datastorage Systems","volume":"35","author":"lee","year":"1999","journal-title":"IEEE Trans Magnetics"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.720539"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.913570"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834437.pdf?arnumber=9834437","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:08Z","timestamp":1773347708000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834437\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834437","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}