Title :
Representation of antiuniform and partially antiuniform Huffman codes
Author :
Esmaeili, M. ; Kokhbod, A. ; Gulliver, T.A.
Author_Institution :
Dept. of Mathematical Sci., Istafan Univ. of Technol., Iran
Abstract :
A source S = {s1,s2, ..., sn} having a binary Huffman code with code lengths satisfying l1 = 1, l2 = 2, ..., ln = n - 1 is called an antiuniform source. If l1 = 1, l2 = 2, ..., li = 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 ≤ i ≤ n - 1, Euclidean projection of these two classes of sources.
Keywords :
Huffman codes; binary codes; source coding; antiuniform source; partially antiuniform Huffman codes; Binary codes; Huffman coding; Probability distribution;
Conference_Titel :
Communications, Computers and signal Processing, 2005. PACRIM. 2005 IEEE Pacific Rim Conference on
Print_ISBN :
0-7803-9195-0
DOI :
10.1109/PACRIM.2005.1517259