Simple bounds on the numbers of binary Huffman sequences

zbMATH Open1222.11020MaRDI QIDQ3567541FDOQ3567541

Authors: J. Burkert 

Publication date: 17 June 2010

Recommendations

• Computing and estimating the number of \(n\)-ary Huffman sequences of a specified length
• Huffman codes and maximizing properties of Fibonacci numbers
• On the maximum length of Huffman codes
• Generating Huffman sequences
• Huffman trees and fibonacci numbers

zbMATH Keywords

Catalan numbersFibonacci numbersHuffman sequence

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Cited In (6)

• Fixed-prefix encoding of the integers can be Huffman-optimal
• Generating Huffman sequences
• Kinematic twist-three contributions to pseudo- and quasi-GPDs and translation invariance
• Computing and estimating the number of \(n\)-ary Huffman sequences of a specified length
• Algorithmic counting of nonequivalent compact Huffman codes
• Huffman sequences with uniform time energy distribution

This page was built for publication: Simple bounds on the numbers of binary Huffman sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3567541)