• Corpus ID: 59523664

Algorithmic counting of nonequivalent compact Huffman codes

  title={Algorithmic counting of nonequivalent compact Huffman codes},
  author={Christian Elsholtz and Clemens Heuberger and Daniel Krenn},
It is known that the following five counting problems lead to the same integer sequence~$f_t(n)$: the number of nonequivalent compact Huffman codes of length~$n$ over an alphabet of $t$ letters, the number of `nonequivalent' canonical rooted $t$-ary trees (level-greedy trees) with $n$~leaves, the number of `proper' words, the number of bounded degree sequences, and the number of ways of writing $1= \frac{1}{t^{x_1}}+ \dots + \frac{1}{t^{x_n}}$ with integers $0 \leq x_1 \leq x_2 \leq \dots \leq… 

Tables from this paper


Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis
The probabilistic behavior of the height (limit distribution is shown to be normal), the number of distinct summands (normal distribution), the path length, the width, and the width (main term of the expectation and concentration property) are studied.
What is an answer? - remarks, results and problems on PIO formulas in combinatorial enumeration, part I
It is proved here that every linear recurrence sequence of integers has an effective formula in the sense of being closed in the authors' sense.
Analysis of parameters of trees corresponding to Huffman codes and sums of unit fractions
The probabilistic behaviour of the height, the number of distinct summands, the path length, the length of the path, the width, and the width of the leaves at maximum distance from the root are studied.
A New Algorithm for Generating all Binary Huffman Codes Based on Path-Length Extensions
This paper develops a recursive algorithm to generate all possible binary Huffman codes without addressing their use in lossless data compression and develops the key concept named path-length extension.
Integer multiplication in time O(n log n)
An algorithm is presented that computes the product of two n-bit integers in O(n log n) bit operations, thus confirming a conjecture of Schonhage and Strassen from 1971, and using a novel “Gaussian resampling” technique that enables the integer multiplication problem to be reduced to a collection of multidimensional discrete Fourier transforms over the complex numbers.
The supertree of the compact codes
ST <sup>n</sup>(D), the supertree of all D-ary compact codes, is introduced and any node in the m-th level of ST <sup >n</Sup>(D) is associated with a unique compact code with 2D-1+m(D- 1) codewords.
The Complexity of Computations
This chapter provides a survey of the main concepts and results of the computational complexity theory, starting with basic concepts such as time and space complexities, complexity classes P and NP, and Boolean circuits and two related ways to make computations more efficient.
Fast integer multiplication using modular arithmetic
An algorithm for multiplying two N-bit integers that improves the O(N • log N • log log N) algorithm by Schönhage-Strassen and can be viewed as a p-adic version of Fürer's algorithm.
Faster integer multiplication
A major step towards closing the gap from above is presented by presenting an algorithm running in time n log n, 2O(log* n) for boolean circuits as well as for multitape Turing machines, but it has consequences to other models of computation as well.
An algorithm for the machine calculation of complex Fourier series
Good generalized these methods and gave elegant algorithms for which one class of applications is the calculation of Fourier series, applicable to certain problems in which one must multiply an N-vector by an N X N matrix which can be factored into m sparse matrices.