Paper Abstract and Keywords |
Presentation |
2018-07-19 16:20
Easy Construction of Binary AIFV Codes for Unequal Letter Costs Takahiro Yoshida (The Univ. Tokyo), Hirosuke Yamamoto (Meiji Univ.) IT2018-18 |
Abstract |
(in Japanese) |
(See Japanese page) |
(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) |
(in English) |
letter costs / AIFV code / source coding / data compression / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 118, no. 139, IT2018-18, pp. 31-36, July 2018. |
Paper # |
IT2018-18 |
Date of Issue |
2018-07-12 (IT) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
IT2018-18 |
Conference Information |
Committee |
IT |
Conference Date |
2018-07-19 - 2018-07-20 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Yamato Kaigishitsu |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
freshman session, general |
Paper Information |
Registration To |
IT |
Conference Code |
2018-07-IT |
Language |
Japanese |
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 |
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
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.) |
3rd Author's Name |
|
3rd Author's Affiliation |
() |
4th Author's Name |
|
4th Author's Affiliation |
() |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2018-07-19 16:20:00 |
Presentation Time |
25 minutes |
Registration for |
IT |
Paper # |
IT2018-18 |
Volume (vol) |
vol.118 |
Number (no) |
no.139 |
Page |
pp.31-36 |
#Pages |
6 |
Date of Issue |
2018-07-12 (IT) |
|