Technical Program

Paper Detail

Paper IDO.1.2
Paper Title On a Redundancy of AIFV-m Codes for m = 3, 5
Authors Ryusei Fujita, Ken-ichi Iwata, University of Fukui, Japan; Hirosuke Yamamoto, The University of Tokyo, Japan
Session O.1: Data Compression
Presentation Lecture
Track Source Coding
Manuscript  Click here to download the manuscript
Virtual Presentation  Click here to watch in the Virtual Symposium
Abstract Hu, Yamamoto, Honda proposed the binary AIFV-m codes and proved that the worst-case redundancy of optimal binary AIFV-m codes is exactly 1/m for m = 2,3,4. We derive a new upper bound on the redundancy of optimal binary AIFV-3 codes when the probability of the most likely source symbol is known. Furthermore, it is proved by using the redundancy bound of optimal binary AIFV-3 codes that the worst-case redundancy of optimal binary AIFV-5 codes is exactly 1/5.

Plan Ahead

IEEE ISIT 2021

2021 IEEE International Symposium on Information Theory

11-16 July 2021 | Melbourne, Victoria, Australia

Visit Website!