An Algorithm for Constructing the Optimal Code Trees for Binary Alphabetic AIFV-m Codes
Ken‐ichi Iwata, H. Yamamoto · 2021
We call the alphabetic version of the AIFV-m code the alphabetic AIFV-m codes. This paper defines binary alphabetic AIFV-m codes and proposes an algorithm to design the optimal binary alphabetic AIFV-m codes in terms of the minimum average codeword length for stationary memoryless sources. The proposed method is based on an iterative optimization algorithm and a dynamic programming algorithm.