Height Restricted Optimal Binary Trees

DOI10.1137/0216070zbMath0654.68076OpenAlexW2084029055MaRDI QIDQ3801088

Lawrence L. Larmore

Publication date: 1987

Published in: SIAM Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

binary treeHuffman coding

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Information storage and retrieval of data (68P20) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (4)

Trading off worst and expected cost in decision tree problems ⋮ On the Huffman and alphabetic tree problem with general cost functions ⋮ Monotonicity and efficient computation of optimal dichotomous search ⋮ Optimum extensions of prefix codes.

This page was built for publication: Height Restricted Optimal Binary Trees