On a Redundancy of AIFV-m Codes for m =3,5

Hu, Yamamoto, Honda proposed the binary AIFVm 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.

[1]  Hirosuke Yamamoto,et al.  An Iterative Algorithm to Optimize the Average Performance of Markov Chains with Finite States , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[2]  Junya Honda,et al.  Almost Instantaneous Fixed-to-Variable Length Codes , 2015, IEEE Transactions on Information Theory.

[3]  Hirosuke Yamamoto,et al.  An Optimality Proof of the Iterative Algorithm for AIFV-m Codes , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[4]  Junya Honda,et al.  Worst-case Redundancy of Optimal Binary AIFV Codes and Their Extended Codes , 2017, IEEE Transactions on Information Theory.

[5]  Robert G. Gallager,et al.  Variations on a theme by Huffman , 1978, IEEE Trans. Inf. Theory.