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

DOI10.1016/J.DISC.2010.08.017MaRDI QIDQ616352zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 1907194 (Why is no real title available?)
• Generating Huffman sequences
• Generation and enumeration of all solutions of the characteristic sum condition
• Simple bounds on the numbers of binary Huffman sequences
• The number of different possible compact codes (Corresp.)

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)