A New Proof of the T-C Algorithm

DOI10.1137/0125012zbMath0255.94008OpenAlexW2063794498MaRDI QIDQ5670536

No author found.

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)

Related Items (7)

Set Orderings Requiring Costliest Alphabetic Binary Trees ⋮ Parallel construction of binary trees with near optimal weighted path length ⋮ Operations research applications of dichotomous search ⋮ Correctness of constructing optimal alphabetic trees revisited ⋮ The Optimal Alphabetic Tree problem revisited ⋮ On the Huffman and alphabetic tree problem with general cost functions ⋮ Optimal binary search trees

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