Huffman's algorithm via algebra

DOI10.1016/0097-3165(82)90021-8MaRDI QIDQ1168073zbMATH OpenOpenAlexFDO

Authors 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) Ordered rings, algebras, modules (06F25) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99) Theory of error-correcting codes and error-detecting codes (94B99)

Cites work

• A Method for the Construction of Minimum-Redundancy Codes
• An optimum encoding with minimum longest code and total number of digits
• Binary Trees Optimum Under Various Criteria
• Combinatorial Merging
• Conditions for Optimality of the Huffman Algorithm
• Generalized Huffman Trees
• scientific article; zbMATH DE number 3558968 (Why is no real title available?)
• scientific article; zbMATH DE number 3225653 (Why is no real title available?)
• On the Optimality of Huffman Trees
• Optimal Alphabetic Trees
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes

Cited in

(1)

• Huffman algebras for independent random variables

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

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