Abstract
Ternary AIFV codes are almost instantaneous fixed-to-variable length codes, and are constructed based on two code trees. It is known that the redundancy of ternary AIFV codes is no more than one. In this paper, we provide a tighter upper bound on the redundancy of the ternary Huffman codes when the greatest probability of the source <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p<sub>max</sub></i> is known. As a result, the redundancy of the optimal ternary AIFV codes is bounded by Huffman codes, since the ternary Huffman codes can be seen as the special AIFV codes. To achieve lower redundancy than Huffman codes, we also propose a method to construct a class of ternary AIFV codes with time complexity <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">O(n)</i> for <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> source symbols. In addition, the redundancy of the proposed AIFV codes is analyzed and compared with Huffman codes. Analyzing the ternary AIFV codes constructed by the algorithm, we derive a tighter redundancy upper bounds under some conditions, which are superior to Huffman codes.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
