|| AIVF Codes Based on Iterative Algorithm and Dynamic Programming
||Ken-ichi Iwata, University of Fukui, Japan; Hirosuke Yamamoto, The University of Tokyo, Japan|
||D5-S1-T2: Variable-Length Codes
||Friday, 16 July, 22:00 - 22:20
||Friday, 16 July, 22:20 - 22:40
This paper gives a methodology for optimizing AIVF (almost instantaneous variable-to-fixed length) codes based on two algorithms: The first algorithm is the dynamic programming (DP) technique developed by Dubé and Haddad to construct a set of parse trees of AIVF codes. The second algorithm is the iterative optimization algorithm proposed by Fujita, Iwata, and Yamamoto, which can maximize the average parse length of AIVF codes. As a result, the proposed AIVF code achieves a longer average parse length than the known AIVF codes and Tunstall codes.