Presentation 2020-12-02
On the Optimality of the AIFV Code for Average Codeword Length
Kengo Hashimoto, Ken-ichi Iwata,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) McMillan's inequality proved that Huffman code attains an optimal average code length in a class of source codes that can be uniquely decodable using a single code tree. On the other hand, AIFV code can attain shorter average code length than Huffman code if it allows for a 2-bit decoding delay and two code trees. This paper proves that AIFV code achieves an optimal average code length in a class of source codes allowing for a 2-bit decoding delay and two code trees.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) source coding / AIFV code / average code length / optimality
Paper # IT2020-34
Date of Issue 2020-11-24 (IT)

Conference Information
Committee IT
Conference Date 2020/12/1(3days)
Place (in Japanese) (See Japanese page)
Place (in English) Online
Topics (in Japanese) (See Japanese page)
Topics (in English) Lectures for Young Researchers, General
Chair Tadashi Wadayama(Nagoya Inst. of Tech.)
Vice Chair Tetsuya Kojima(Tokyo Kosen)
Secretary Tetsuya Kojima(Yamaguchi Univ.)
Assistant Takahiro Ohta(Senshu Univ.)

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) On the Optimality of the AIFV Code for Average Codeword Length
Sub Title (in English)
Keyword(1) source coding
Keyword(2) AIFV code
Keyword(3) average code length
Keyword(4) optimality
1st Author's Name Kengo Hashimoto
1st Author's Affiliation University of Fukui(Univ. of Fukui)
2nd Author's Name Ken-ichi Iwata
2nd Author's Affiliation University of Fukui(Univ. of Fukui)
Date 2020-12-02
Paper # IT2020-34
Volume (vol) vol.120
Number (no) IT-268
Page pp.pp.56-61(IT),
#Pages 6
Date of Issue 2020-11-24 (IT)