Huffman's algorithm via algebra

DOI10.1016/0097-3165(82)90021-8zbMath0492.68035OpenAlexW1973527968MaRDI QIDQ1168073

Donald E. Knuth

Publication date: 1982

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(82)90021-8

zbMATH Keywords

Huffman algebralinearly ordered set with a commutative binary operationminimum redundancy codessmallest expression on a given multiset of elements in a Huffman algebra

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Theory of error-correcting codes and error-detecting codes (94B99) Ordered rings, algebras, modules (06F25) Algorithms in computer science (68W99)

Related Items (1)

Huffman algebras for independent random variables

Cites Work

• Unnamed Item
• Unnamed Item
• Conditions for Optimality of the Huffman Algorithm
• Optimal Alphabetic Trees
• On the Optimality of Huffman Trees
• Combinatorial Merging
• Generalized Huffman Trees
• Binary Trees Optimum Under Various Criteria
• A Method for the Construction of Minimum-Redundancy Codes
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• An optimum encoding with minimum longest code and total number of digits

This page was built for publication: Huffman's algorithm via algebra