The number of Huffman codes, compact trees, and sums of unit fractions

Details The number of Huffman codes, compact trees, and sums of unit fractions The number of Huffman codes, compact trees, and sums of unit fractions

2011-08-30

arxiv.org/abs/1108.5964v1

Mathematics

Combinatorics

Scientific paper

The number of "nonequivalent" Huffman codes of length r over an alphabet of size t has been studied frequently. Equivalently, the number of "nonequivalent" complete t-ary trees has been examined. We first survey the literature, unifying several independent approaches to the problem. Then, improving on earlier work we prove a very precise asymptotic result on the counting function, consisting of two main terms and an error term.

Affiliated with

Also associated with

No associations

Rating

The number of Huffman codes, compact trees, and sums of unit fractions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The number of Huffman codes, compact trees, and sums of unit fractions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The number of Huffman codes, compact trees, and sums of unit fractions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-729057