The Optimal Fix-Free Code for Anti-Uniform Sources

Abstract

An n symbol source which has a Huffman code with codelength vector L n = (1, 2, 3, · · · , n − 2, n − 1, n − 1) is called an anti-uniform source. In this paper, it is shown that for this class of sources, the optimal fix-free code and symmetric fix-free code is C * n = (0, 11, 101, 1001, · · · , 1 n−2 0 · · · 0 1).