| Presentation | 2018-01-22 A Consideration on Conditions of Extended Binary Memoryless Sources where Different Huffman Codes are Constructed Nozomi Miya, Takahiro Yoshida, Hajime Jinushi, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Different Huffman codes, i.e., different codeword sets constructed in Huffman coding are given for $n$-th degree extended binary memoryless sources whose alphabet is ${ 0, 1}^{n}$ if $(n, p)$ varies, where $p geq 1 / 2$ denotes the probability that symbol 0 occurs. In the case that $n > 2$, sufficient conditions w.r.t. $(n, p)$ for constructing $2n - 1$ different Huffman codes and the range where they do or do not coincide with necessary conditions have been presented. In this study, the range is extended and the example is shown in the case that each sum of the two smallest probabilities in the first and second steps of the reduction is in $[P_{k}, P_{k - 1})$, where $P_{k}$ denotes the probability of the source symbol with $k$ symbols of 1. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | source coding / data compression / Huffman coding / binary memoryless sources / extended sources |
| Paper # | IT2017-61,SIP2017-69,RCS2017-275 |
| Date of Issue | 2018-01-15 (IT, SIP, RCS) |
| Conference Information | |
| Committee | SIP / IT / RCS |
|---|---|
| Conference Date | 2018/1/22(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Sunport Hall Takamatsu |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Masahiro Okuda(Univ. of Kitakyushu) / Masayoshi Ohashi(Fukuoka Univ.) / Hidekazu Murata(Kyoto Univ.) |
| Vice Chair | Shogo Muramatsu(Niigata Univ.) / Naoyuki Aikawa(TUS) / Jun Muramatsu(NTT) / Yukitoshi Sanada(Keio Univ.) / Eisuke Fukuda(Fujitsu Labs.) / Satoshi Suyama(NTT DoCoMo) |
| Secretary | Shogo Muramatsu(Chiba Inst. of Tech.) / Naoyuki Aikawa(Takushoku Univ.) / Jun Muramatsu(Yokohama College of Commerce) / Yukitoshi Sanada(UEC) / Eisuke Fukuda(Toshiba) / Satoshi Suyama(Hokkaido Univ.) |
| Assistant | Masayoshi Nakamoto(Hiroshima Univ.ひろ) / Sigeaki Kuzuoka(wakayama univ.) / Tetsuya Yamamoto(Panasonic) / Koichi Ishihara(NTT) / Kazushi Muraoka(NEC) / Shinsuke Ibi(Osaka Univ.) / Hiroshi Nishimoto(Mitsubishi Electric) |
| Paper Information | |
| Registration To | Technical Committee on Signal Processing / Technical Committee on Information Theory / Technical Committee on Radio Communication Systems |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A Consideration on Conditions of Extended Binary Memoryless Sources where Different Huffman Codes are Constructed |
| Sub Title (in English) | A Case that Combined Symbols Belong to the Same Group in the First and Second Steps of the Reduction |
| Keyword(1) | source coding |
| Keyword(2) | data compression |
| Keyword(3) | Huffman coding |
| Keyword(4) | binary memoryless sources |
| Keyword(5) | extended sources |
| 1st Author's Name | Nozomi Miya |
| 1st Author's Affiliation | Aoyama Gakuin University(Aoyama Gakuin Univ.) |
| 2nd Author's Name | Takahiro Yoshida |
| 2nd Author's Affiliation | Yokohama College of Commerce(Yokohama College of Commerce) |
| 3rd Author's Name | Hajime Jinushi |
| 3rd Author's Affiliation | Aoyama Gakuin University(Aoyama Gakuin Univ.) |
| Date | 2018-01-22 |
| Paper # | IT2017-61,SIP2017-69,RCS2017-275 |
| Volume (vol) | vol.117 |
| Number (no) | IT-394,SIP-395,RCS-396 |
| Page | pp.pp.37-42(IT), pp.37-42(SIP), pp.37-42(RCS), |
| #Pages | 6 |
| Date of Issue | 2018-01-15 (IT, SIP, RCS) |