Best Huffman trees

DOI10.1007/BF00289311zbMath0476.94021MaRDI QIDQ1160111

George Markowsky

Publication date: 1981

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

weighted treesdistribution of labelsminimal expected length

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (2)

Optimal binary search trees ⋮ Monotonicity and efficient computation of optimal dichotomous search

Cites Work

• Unnamed Item
• Unnamed Item
• A Method for the Construction of Minimum-Redundancy Codes
• An optimum encoding with minimum longest code and total number of digits

This page was built for publication: Best Huffman trees