Summary
The 2018 International Symposium on Information Theory and Its Applications　(ISITA2018)
2018
Session Number:We-AM-1-3
Session:
Number:We-AM-1-3.2
Dynamic AIFV Coding
Tomotaka HIRAOKA, Hirosuke YAMAMOTO,
pp.577-581
Publication Date:2018/10/18
Online ISSN:2188-5079
DOI:10.34385/proc.55.We-AM-1-3.2
PDF download
Summary:
In this paper, we propose two types of dynamic AIFV (almost instantaneous fixed-to-variable length) coding schemes for stationary memoryless sources with unknown probability distribution such that the dynamic AIFV code trees are constructed from the dynamic Huffman code tree. The one is based on the AIFV code with two code trees and the other is based on a simplified AIFV-m code with m code trees. The proposed dynamic AIFV coding can be implemented with almost the same complexity as the dynamic Huffman coding, and it can attain better compression rate than the dynamic Huffman code when the probability of the most likely source symbol is larger than about 0.62.