Almost instantaneous FV codes
H. Yamamoto, Xiaofeng Wei · 2013
In this paper, K-ary almost instantaneous fixed-to-variable-length (AIFV) codes are proposed for K ≥ 3, and it is shown that the K-ary AIFV codes using K - 1 code trees can attain better compression than K-ary Huffman codes for stationary memoryless sources. Furthermore, it is also shown that binary relaxed AIFV codes with two code trees can beat binary Huffman codes.