The optimal overflow and underflow probabilities of variable-length coding for the general source

作     者：Uchida, O Han, TS 

作者机构：Kanagawa Inst Technol Dept Network Engn Atsugi Kanagawa 2430292 Japan Univ Electrocommun Grad Sch Informat Syst Chofu Tokyo 1828585 Japan 

出 版 物：《IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES》 (电子信息通信学会汇刊：电子学、通信及计算机科学基础)

年 卷 期：2001年第E84A卷第10期

页      面：2457-2465页

核心收录：

学科分类：0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：overflow probability underflow probability general source variable-length source coding reliability function 

摘      要：In variable-length coding, the probability of codeword length per source letter being above (resp. below) a prescribed threshold is called the overflow (resp. the underflow) probability. In this paper, we show that the infimum achievable threshold given the overflow probability exponent r always coincides with the infimum achievable fixed-length coding rate given the error exponent r, without any assumptions on the source. In the case of underflow probability, we also show the similar results. From these results, we can utilize various theorems and results on the fixed-length coding established by Han for the analysis of overflow and underflow probabilities. Moreover, we generalize the above results to the case with overflow and underflow probabilities of codeword cost.