Thumbnail
Access Restriction
Subscribed

Author Larmore, Lawrence L. ♦ Hirschberg, Daniel S.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1990
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract An $\textit{O}(\textit{nL})-time$ algorithm is introduced for constructing an optimal Huffman code for a weighted alphabet of size $\textit{n},$ where each code string must have length no greater than $\textit{L}.$ The algorithm uses $\textit{O}(\textit{n})$ space.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1990-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 37
Issue Number 3
Page Count 10
Starting Page 464
Ending Page 473


Open content in new tab

   Open content in new tab
Source: ACM Digital Library