Combinatorial Merging and Huffman's Algorithm

DOI10.1109/TC.1979.1675367MaRDI QIDQ4189199zbMATH OpenFDO

Authors D. Stott Parker

Publication date 1979

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.1979.1675367

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24) Theory of error-correcting codes and error-detecting codes (94B99) Applications of design theory to circuits and networks (94C30)

Cited in

(4)

• Huffman algebras for independent random variables
• Minimax trees in linear time with applications
• Online binary minimax trees
• ON SOME INEQUALITIES AND GENERALIZED ENTROPIES: A UNIFIED APPROAC

This page was built for publication: Combinatorial Merging and Huffman's Algorithm

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