Algorithmic counting of nonequivalent compact Huffman codes

01/31/2019
by   Christian Elsholtz, et al.
0

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= 1/t^x_1+ … + 1/t^x_n with integers 0 ≤ x_1 ≤ x_2 ≤…≤ x_n. In this work, we show that one can compute this sequence for all n<N with essentially one power series division. In total we need at most N^1+ε additions and multiplications of integers of cN bits, c<1, or N^2+ε bit operations, respectively. This improves an earlier bound by Even and Lempel who needed O(N^3) operations in the integer ring or O(N^4) bit operations, respectively.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/23/2018

Counting Extended Irreducible Goppa Codes

We obtain an upper bound on the number of extended irreducible q-ary Gop...
research
03/26/2019

Enumeration of irreducible and extended irreducible Goppa codes

We obtain upper bounds on the number of irreducible and extended irreduc...
research
02/06/2022

Alpha Blending with No Division Operations

Highly accurate alpha blending can be performed entirely with integer op...
research
05/15/2018

A class of repeated-root constacyclic codes over F_p^m[u]/〈 u^e〉 of Type 2

Let F_p^m be a finite field of cardinality p^m where p is an odd prime, ...
research
07/13/2023

Integer sequences that are generalized weights of a linear code

Which integer sequences are sequences of generalized weights of a linear...
research
11/22/2021

On the Local Communication Complexity of Counting and Modular Arithmetic

In standard number-in-hand multi-party communication complexity, perform...
research
01/29/2020

qBSA: Logic Design of a 32-bit Block-Skewed RSFQ Arithmetic Logic Unit

Single flux quantum (SFQ) circuits are an attractive beyond-CMOS technol...

Please sign up or login with your details

Forgot password? Click here to reset