{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T03:08:47Z","timestamp":1730344127468,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.23919\/isita.2018.8664266","type":"proceedings-article","created":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T23:49:11Z","timestamp":1552348151000},"page":"364-368","source":"Crossref","is-referenced-by-count":0,"title":["Overflow Probability of Codeword Cost in Variable-Length Coding Problem Allowing Non-Vanishing Error Probability"],"prefix":"10.23919","author":[{"given":"Ryo","family":"Nomura","sequence":"first","affiliation":[]},{"given":"Hideki","family":"Yagi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2291007"},{"key":"ref11","first-page":"21","article-title":"Threshold of overflow probability in terms of smooth max-entropy for variable-length compression allowing errors","author":"saito","year":"2016","journal-title":"Proc 2016 IEEE International Symposium on Information Theory and Its Applications"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8277930"},{"key":"ref13","first-page":"524","article-title":"Kolmogorov complexity with cost and stochastic processes","volume":"j80 a","author":"han","year":"1997","journal-title":"IEICE Trans Fundamentals (Japanese Edition)"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/18.825849","article-title":"Source code with cost as a nonuniform random number generator","volume":"46","author":"han","year":"2000","journal-title":"IEEE Trans Inf Theory"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12066-8","author":"han","year":"2003","journal-title":"Information-spectrum methods in information theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E100.A.1683"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2438831"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.79912"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e90-a.12.2965"},{"key":"ref7","first-page":"2457","article-title":"The optimal overflow and underflow probabilities of variable-length coding for general source","volume":"e84 a","author":"uchida","year":"2001","journal-title":"IEICE Trans Fundamentals"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.844098"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"1217","DOI":"10.1109\/18.850664","article-title":"Weak variable-length source coding","volume":"46","author":"han","year":"2000","journal-title":"IEEE Trans Inf Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283022"}],"event":{"name":"2018 International Symposium on Information Theory and Its Applications (ISITA)","start":{"date-parts":[[2018,10,28]]},"location":"Singapore","end":{"date-parts":[[2018,10,31]]}},"container-title":["2018 International Symposium on Information Theory and Its Applications (ISITA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8660385\/8664205\/08664266.pdf?arnumber=8664266","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T06:21:00Z","timestamp":1643264460000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8664266\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":15,"URL":"https:\/\/doi.org\/10.23919\/isita.2018.8664266","relation":{},"subject":[],"published":{"date-parts":[[2018,10]]}}}