Representation of antiuniform and partially antiuniform Huffman codes
Morteza Esmaeili, Ali Kakhbod, Thomas Aaron Gulliver · 2005
A source S = {s/sub 1/,s/sub 2/, ..., s/sub n/} having a binary Huffman code with code lengths satisfying l/sub 1/ = 1, l/sub 2/ = 2, ..., l/sub n/ = n - 1 is called an antiuniform source. If l/sub 1/ = 1, l/sub 2/ = 2, ..., l/sub i/ = i, then the source is called an i-level partially antiuniform source. In this paper we characterise these sources, and represent them by a system of linear inequalities. In addition, we determine the i-dimensional, 2 /spl les/ i /spl les/ n - 1, Euclidean projection of these two classes of sources.