| Presentation | 2018-07-19 Easy Construction of Binary AIFV Codes for Unequal Letter Costs Takahiro Yoshida, Hirosuke Yamamoto, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In the case that the costs of letters (code symbols) 0 and 1 are equal, it is known that the AIFV code with two code trees $T_0$ and $T_1$ can attain better compression rate than the Huffman code with a single code tree $T_{rm H}$. Furthermore, if we use the so-called easy construction of an AIFV code, the code trees $T_0$ and $T_1$ can be easily constructed from Huffman code tree $T_{rm H}$. Although the obtained AIFV code is not optimal generally, it can usually attain better compression rate than the Huffman code. In this paper, we treat AIFV coding and propose easy construction algorithms of AIFV codes for unequal letter costs. In ordinary AIFV code trees, a master node is connected to its grandchild by code symbols `00'. But, we consider the cases that a master node is connected to its grandchild by `01', `10', `11' in addition to `00', and we clarify the merits and demerits for their cases. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | letter costs / AIFV code / source coding / data compression |
| Paper # | IT2018-18 |
| Date of Issue | 2018-07-12 (IT) |
| Conference Information | |
| Committee | IT |
|---|---|
| Conference Date | 2018/7/19(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Yamato Kaigishitsu |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | freshman session, general |
| Chair | Jun Muramatsu(NTT) |
| Vice Chair | Tadashi Wadayama(Nagoya Inst. of Tech.) |
| Secretary | Tadashi Wadayama(Nagano Pref Inst. of Tech.) |
| Assistant | Takahiro Yoshida(Yokohama College of Commerce) |
| Paper Information | |
| Registration To | Technical Committee on Information Theory |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Easy Construction of Binary AIFV Codes for Unequal Letter Costs |
| Sub Title (in English) | |
| Keyword(1) | letter costs |
| Keyword(2) | AIFV code |
| Keyword(3) | source coding |
| Keyword(4) | data compression |
| 1st Author's Name | Takahiro Yoshida |
| 1st Author's Affiliation | The University of Tokyo(The Univ. Tokyo) |
| 2nd Author's Name | Hirosuke Yamamoto |
| 2nd Author's Affiliation | Meiji University(Meiji Univ.) |
| Date | 2018-07-19 |
| Paper # | IT2018-18 |
| Volume (vol) | vol.118 |
| Number (no) | IT-139 |
| Page | pp.pp.31-36(IT), |
| #Pages | 6 |
| Date of Issue | 2018-07-12 (IT) |