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.


Presenters

Ryusei Fujita

University of Fukui

Ken-ichi Iwata

Fukui University

Hirosuke Yamamoto

University of Tokyo
Private Conversation

Reach out to the speaker privately


Questions & Answers

Post a publicly available question

No questions have been asked.

Session Chair

Marcelo Weinberger

Center for Science of Information