A fast algorithm for optimal length-limited Huffman codes

DOI10.1145/79147.79150zbMath0699.68070OpenAlexW2021302562WikidataQ127769903 ScholiaQ127769903MaRDI QIDQ3477965

Lawrence L. Larmore, Daniel S. Hirschberg

Publication date: 1990

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/79147.79150

zbMATH Keywords

binary treedataHuffman codingcoding and information theorycompaction and compression

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Prefix, length-variable, comma-free codes (94A45)

Related Items (10)

Decision trees for function evaluation: simultaneous optimization of worst and expected cost ⋮ Trading off worst and expected cost in decision tree problems ⋮ Correctness of constructing optimal alphabetic trees revisited ⋮ Exact and approximation algorithms for error-detecting even codes ⋮ Trees with exponentially growing costs ⋮ Is Huffmann coding dead? ⋮ Solving sequential knapsack problems ⋮ Optimal binary search trees ⋮ Parity codes ⋮ Space-efficient Huffman codes revisited

This page was built for publication: A fast algorithm for optimal length-limited Huffman codes