Abstract
An O1990-time algorithm is introduced for constructing an optimal Huffman code for a weighted alphabet of size n, where each code string must have length no greater than L. The algorithm uses O(n) space. © 1990, ACM. All rights reserved.
Cite
CITATION STYLE
APA
Larmore, L. L., & Hirschberg, D. S. (1990). A Fast Algorithm for Optimal Length-Limited Huffman Codes. Journal of the ACM (JACM), 37(3), 464–473. https://doi.org/10.1145/79147.79150
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free