@inproceedings{97f1c296007c4f3b849130da99454da0,
title = "Tight bounds on the AUH codes",
abstract = "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 the alphabet size of the source. Also an upper bound on the entropy of AUH codes Is also presented in terms of the average cost of the code. The Fibonacci distributions are introduced which play a fundamental role in AUH codes. It is shown that such distributions maximize the average length and the entropy of the code for a given alphabet size. Another previously known bound on the entropy for given average length follows immediately from our results.",
keywords = "AUH codes, Average cost, Average length, Entropy, Fibonacci distributions, Redundancy",
author = "Soheil Mohajer and Ali Kakhbod",
year = "2008",
month = sep,
day = "22",
doi = "10.1109/CISS.2008.4558666",
language = "English (US)",
isbn = "9781424422470",
series = "CISS 2008, The 42nd Annual Conference on Information Sciences and Systems",
pages = "1010--1014",
booktitle = "CISS 2008, The 42nd Annual Conference on Information Sciences and Systems",
note = "CISS 2008, 42nd Annual Conference on Information Sciences and Systems ; Conference date: 19-03-2008 Through 21-03-2008",
}