TY - GEN

T1 - Overflow Probability of Codeword Cost in Variable-Length Coding Problem Allowing Non-Vanishing Error Probability

AU - Nomura, Ryo

AU - Yagi, Hideki

N1 - Funding Information:
This work was supported in part by JSPS KAKENHI Grant Numbers JP18K04150 and JP16K06340.

PY - 2019/3/8

Y1 - 2019/3/8

N2 - The variable-length source coding with unequal cost allowing error probability is considered for general sources. In this setting, the first- and second-order optimum mean codeword cost have already been determined. On the other hand, we focus on the overflow probability of codeword cost and determine the general formulas of the first- and second-order optimum achievable overflow threshold. We also apply our general formulas to the stationary memoryless source.

AB - The variable-length source coding with unequal cost allowing error probability is considered for general sources. In this setting, the first- and second-order optimum mean codeword cost have already been determined. On the other hand, we focus on the overflow probability of codeword cost and determine the general formulas of the first- and second-order optimum achievable overflow threshold. We also apply our general formulas to the stationary memoryless source.

UR - http://www.scopus.com/inward/record.url?scp=85063917905&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85063917905&partnerID=8YFLogxK

U2 - 10.23919/ISITA.2018.8664266

DO - 10.23919/ISITA.2018.8664266

M3 - Conference contribution

AN - SCOPUS:85063917905

T3 - Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018

SP - 364

EP - 368

BT - Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 15th International Symposium on Information Theory and Its Applications, ISITA 2018

Y2 - 28 October 2018 through 31 October 2018

ER -