Generating Huffman sequences

DOI10.1016/J.JALGOR.2004.04.003zbMATH Open1090.68116OpenAlexW2078283200MaRDI QIDQ4651817FDOQ4651817

Authors: D. G. Hoffman, Nadine Wilson, P. D. jun. Johnson 

Publication date: 22 February 2005

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.04.003

Recommendations

• An algorithm for generating Huffman sequences in lexicographic order
• Computing and estimating the number of \(n\)-ary Huffman sequences of a specified length
• A fast algorithm for optimal length-limited Huffman codes
• Simple bounds on the numbers of binary Huffman sequences
• Huffman sequences with uniform time energy distribution

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Nonnumerical algorithms (68W05)

Cited In (5)

• Computing and estimating the number of \(n\)-ary Huffman sequences of a specified length
• Algorithmic counting of nonequivalent compact Huffman codes
• An algorithm for generating Huffman sequences in lexicographic order
• Huffman sequences with uniform time energy distribution
• Simple bounds on the numbers of binary Huffman sequences

This page was built for publication: Generating Huffman sequences

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