| タイトル | On the Overflow Probability of Lossless Codes for Mixed Sources |
|---|---|
| 著者 | 野村亮 、松嶋敏泰 、平澤茂一 |
| 年度 | 2008 |
| 形式 | 国内学会 |
| 分野 | 情報源符号化 |
| 掲載雑誌名 | 第31回情報理論とその応用シンポジウム予稿集 |
| 掲載号・ページ | pp.462-467 |
| 掲載年 | 2008 |
| 掲載月 | 10 |
| アブスト （日本語） |
学会名：第31回情報理論とその応用シンポジウム(SITA2008) 日程：2008年10月7日～10月10日 場所：栃木県 |
| アブスト （英語） |
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. |
| 備考 （日本語） |
1 |
| 備考 （英語） |
1 |
| 論文原稿 | |
| 発表資料 |
