Anti-uniform Huffman codes

Anti-uniform Huffman codes

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

In this study, the authors consider the class of anti-uniform Huffman (AUH) codes. The authors derived tight lower and upper bounds on the average codeword length, entropy and redundancy of finite and infinite AUH codes in terms of the alphabet size of the source. These bounds are tighter than similar bounds. Also a tight upper bound on the entropy of AUH codes is presented in terms of the average cost of the code. The Fibonacci distribution is introduced, which plays a fundamental role in AUH codes. It is shown that such distributions maximise the average length and the entropy of the code for a given alphabet size. The authors also show that the minimum average cost of a code is achieved by an AUH codes in a highly unbalanced cost regime.

Inspec keywords: Huffman codes

Other keywords: code entropy; antiuniform Huffman code; AUH code; alphabet size

Subjects: Codes


    1. 1)
    2. 2)
      • Esmaeili, M., Kakhbod, A.: `On antiuniform and partially antiuniform sources', Proc. IEEE ICC, June 2006, p. 1611–1615.
    3. 3)
    4. 4)
    5. 5)
    6. 6)
    7. 7)
      • Mohajer, S., Pakzad, P., Kakhbod, A.: `Tight bounds on the redundancy of huffman codes', Proc. IEEE ITW, March 2006, p. 131–135.
    8. 8)
    9. 9)
      • M. Esmaeili . On the weakly superincreasing distributions and the Fibonacci–Hessenberg matrices. ARS Comb. , 217 - 224

Related content

This is a required field
Please enter a valid email address