Skip to main content
Open Access Publications from the University of California

Length limited coding and optimal height-limited binary trees


A new O(nL)-time algorithm is given for finding an optimal prefix-free binary code for a weighted alphabet of size n, with the restriction that no code string be longer than L. An O(nL logn)-time algorithm is given for the corresponding alphabetic problem problem, which is equivalent to optimizing a dictionary of n words, implemented as a binary tree of height h

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View