The Optimal Overflow and Underflow Probabilities of Variable-Length Coding for the General Source(Special Section on Information Theory and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• 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 γ always coincides with the infimum achievable fixed-length coding rate given the error exponent γ, 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.

• 社団法人電子情報通信学会の論文
• 2001-10-01

著者

• Uchida Osamu

  The Department Of Network Engineering Kanagawa Institute Of Technology

• HAN Te

  the Graduate School of Information Systems, University of Electro-Communications

• Han Te

  The Graduate School Of Information Systems University Of Electro-communications

関連論文

• The Optimal Overflow and Underflow Probabilities of Variable-Length Coding for the General Source(Special Section on Information Theory and Its Applications)

スポンサーリンク