The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
가변 길이 코딩에서 소스 문자당 코드워드 길이가 규정된 임계값보다 높을(각각 이하) 확률을 오버플로(각각 언더플로) 확률이라고 합니다. 이 논문에서는 오버플로 확률 지수가 주어지면 달성 가능한 극한 임계값을 보여줍니다. r 오류 지수가 주어지면 항상 달성 가능한 극한의 고정 길이 코딩 속도와 일치합니다. r, 소스에 대한 가정 없이. 언더플로우 확률의 경우에도 비슷한 결과를 보여줍니다. 이러한 결과로부터 우리는 오버플로 및 언더플로 확률 분석을 위해 Han이 확립한 고정 길이 코딩에 대한 다양한 정리와 결과를 활용할 수 있습니다. 또한 위의 결과를 코드워드 비용의 오버플로 및 언더플로 확률이 있는 경우로 일반화합니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Osamu UCHIDA, Te Sun HAN, "The Optimal Overflow and Underflow Probabilities of Variable-Length Coding for the General Source" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 10, pp. 2457-2465, October 2001, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_10_2457/_p
부
@ARTICLE{e84-a_10_2457,
author={Osamu UCHIDA, Te Sun HAN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={The Optimal Overflow and Underflow Probabilities of Variable-Length Coding for the General Source},
year={2001},
volume={E84-A},
number={10},
pages={2457-2465},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={October},}
부
TY - JOUR
TI - The Optimal Overflow and Underflow Probabilities of Variable-Length Coding for the General Source
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2457
EP - 2465
AU - Osamu UCHIDA
AU - Te Sun HAN
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2001
AB - 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.
ER -