Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Best Huffman trees

From MaRDI portal
Publication:1160111
Jump to:navigation, search

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1160111&oldid=13222457"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 04:39.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki