Computing and estimating the number of n-ary Huffman sequences of a specified length

DOI10.1016/J.DISC.2010.08.017zbMATH Open1209.94032OpenAlexW2073747838MaRDI QIDQ616352FDOQ616352

Authors: Jordan Paschke, J. Burkert, Rebecca Fehribach 

Publication date: 7 January 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.08.017

Recommendations

• Simple bounds on the numbers of binary Huffman sequences
• Generating Huffman sequences
• An algorithm for generating Huffman sequences in lexicographic order
• On the maximum length of Huffman codes
• scientific article; zbMATH DE number 826041

zbMATH Keywords

linear difference equationsfull \(n\)-ary treeHuffman's algorithm

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Exact enumeration problems, generating functions (05A15)

Cites Work

• Title not available (Why is that?)
• Simple bounds on the numbers of binary Huffman sequences
• Generating Huffman sequences
• The number of different possible compact codes (Corresp.)
• Generation and enumeration of all solutions of the characteristic sum condition

Cited In (4)

• Generating Huffman sequences
• Algorithmic counting of nonequivalent compact Huffman codes
• An algorithm for generating Huffman sequences in lexicographic order
• Simple bounds on the numbers of binary Huffman sequences

This page was built for publication: Computing and estimating the number of \(n\)-ary Huffman sequences of a specified length

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