A New Proof of the T-C Algorithm

DOI10.1137/0125012MaRDI QIDQ5670536zbMATH OpenOpenAlexFDO

Authors

Publication date 1973

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0125012

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• Path Length of Binary Search Trees
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Correctness of constructing optimal alphabetic trees revisited
• A new proof of the Garsia-Wachs algorithm
• A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees

Cited in

(8)

• Proof pearl: Mechanizing the textbook proof of Huffman's algorithm
• On the Huffman and alphabetic tree problem with general cost functions
• Correctness of constructing optimal alphabetic trees revisited
• Parallel construction of binary trees with near optimal weighted path length
• Set Orderings Requiring Costliest Alphabetic Binary Trees
• Optimal binary search trees
• Operations research applications of dichotomous search
• The Optimal Alphabetic Tree problem revisited

This page was built for publication: A New Proof of the T-C Algorithm

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