| タイトル | A Consideration on Classification of Extended Binary Memoryless Sources Under Which Distinct Huffman Codes Are Constructed |
|---|---|
| 著者 | 宮 希望 、吉田 隆弘 、地主 創 |
| 年度 | 2018 |
| 形式 | 国際学会 |
| 分野 | 情報源符号化 |
| 掲載雑誌名 | Proceedings of the 2018 International Symposium on Information Theory and its Applications |
| 掲載号・ページ | pp.572–576, Singapore |
| 掲載年 | 2018 |
| 掲載月 | 10 |
| アブスト （日本語） |
学会名：2018 International Symposium on Information Theory and its Applications (ISITA2018) 日程：2018年10月28–31日（発表日: 31日） 場所：Singapore 査読有 DOI: なし |
| アブスト （英語） |
Distinct Huffman codes, i.e., distinct codeword sets obtained by Huffman's algorithm are constructed for the n-th degree extended binary memoryless sources whose alphabet is {0,1}n if (n,p) varies, where p≥1/2 denotes the probability that symbol 0 occurs. For a fixed n≥2, sufficient conditions with respect to p constructing a part of all distinct Huffman codes have been shown. Necessary conditions with respect to p, constructing such Huffman codes have also been shown. However, sufficient conditions corresponding to some but not all such distinct Huffman codes are equivalent to necessary conditions. In this work, we tighten necessary conditions and discuss whether or not sufficient conditions are equivalent to necessary conditions corresponding to other distinct Huffman codes. In addition, we present examples in which sufficient conditions are or are not equivalent to necessary conditions. |
| 備考 （日本語） |
1 |
| 備考 （英語） |
1 |
| 論文原稿 | |
| 発表資料 |
