- [Home]
- [Research achievement]
- [Research achievement detail]
| Title | On the Overflow Probability of Lossless Codes for Mixed Sources (in Japanese) |
|---|---|
| Authors | Ryo Nomura 、Toshiyasu Matsushima 、Shigeichi Hirasawa |
| Released Year | 2008 |
| Format | Conference |
| Category | Source coding |
| Jounal Name | Proceedings of the 31th Symposium on Information Theory and Its Applications |
| Jounal Page | pp.462-467 |
| Published Year | 2008 |
| Published Month | 10 |
| Abstract （English） |
In this paper, we consider the achievability of variable-length coding. In previous works, we generalized the achievability of variable-length coding from two viewpoints. One is the definition of an overflow probability, and the other is the definition of an achievability. We defined the overflow probability as the probability of codeword length, not per symbol, is larger than ηn. Moreover we defined the -achievability of variable-length codes that implies an existence of a code for the source under the condition that the overflow probability is smaller than or equal to . Then, given we showed the condition of -achievability for the source that the self-information of the source has an asymptotic normality. In this paper, we extend the previous result for mixed sources. In general, the asymptotic normality of the self-information does not hold for mixed sources. We show the necessary and sufficient condition for the -achievability for mixed sources. |
| Note （English） |
1 |
| Manuscript | |
| Presentation |
