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

DOI10.1016/J.DISC.2010.08.017zbMath1209.94032OpenAlexW2073747838MaRDI QIDQ616352

Rebecca Fehribach, Jordan Paschke, Jeffrey Burkert

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

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

Cites Work

• Generating Huffman sequences
• The number of different possible compact codes (Corresp.)
• Generation and enumeration of all solutions of the characteristic sum condition
• Unnamed Item
• Unnamed Item

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