Huffman's algorithm via algebra

DOI10.1016/0097-3165(82)90021-8zbMATH Open0492.68035OpenAlexW1973527968MaRDI QIDQ1168073FDOQ1168073

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Conditions for Optimality of the Huffman Algorithm
• On the Optimality of Huffman Trees
• Optimal Alphabetic Trees
• Binary Trees Optimum Under Various Criteria
• Combinatorial Merging
• Generalized Huffman Trees

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)