scientific article; zbMATH DE number 4014747

MaRDI QIDQ3027031zbMATH OpenFDO

Authors Yasuichi Horibe

Publication date 1984

zbMATH Keywords

compact Huffman tree

Mathematics Subject Classification ID

Trees (05C05) Combinatorial codes (94B25)

Recommendations

• Minimal Huffman trees
• What Costs Are Minimized by Huffman Trees?
• On the linear description of the Huffman trees polytope
• Constructing binary Huffman tree
• scientific article; zbMATH DE number 4031716

Cited in

(8)

• On the Huffman and alphabetic tree problem with general cost functions
• Generalized Huffman coding for binary trees with choosable edge lengths
• Generalized Huffman tree and its application in Chinese character coding
• Canonical trees, compact prefix-free codes, and sums of unit fractions: a probabilistic analysis
• On the linear description of the Huffman trees polytope
• Restricted Hamming–Huffman trees
• Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees
• Algorithmic counting of nonequivalent compact Huffman codes

This page was built for publication:

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