7 citations · 12 across the 14 of their papers we have counts for
Showing cs.ITShow all
3 papers · 1 filter
cs.IT2010
On the Construction of Prefix-Free and Fix-Free Codes with Specified Codeword Compositions
Ali Kakhbod, Morteza Zadimoghaddam
We investigate the construction of prefix-free and fix-free codes with specified codeword compositions. We present a polynomial time algorithm which constructs a fix-free code with…
cs.IT2007
Tight Bounds on the Average Length, Entropy, and Redundancy of Anti-Uniform Huffman Codes
Soheil Mohajer, Ali Kakhbod
In this paper we consider the class of anti-uniform Huffman codes and derive tight lower and upper bounds on the average length, entropy, and redundancy of such codes in terms of t…
cs.IT2005★ 7 cited
Tight Bounds on the Redundancy of Huffman Codes
Soheil Mohajer, Payam Pakzad, Ali Kakhbod
In this paper we study the redundancy of Huffman codes. In particular, we consider sources for which the probability of one of the source symbols is known. We prove a conjecture of…