A fast algorithm for optimal length-limited Huffman codes
Journal of the ACM (JACM)
Overview of the second text retrieval conference (TREC-2)
TREC-2 Proceedings of the second conference on Text retrieval conference
Compression and Coding Algorithms
Compression and Coding Algorithms
A Fast and Space - Economical Algorithm for Length - Limited Coding
ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Efficient construction of minimum-redundancy codes for large alphabets
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
The package-merge strategy of Larmore and Hirschberg [1990] is the foundation of practical solutions to the minimum-redundancy length-restricted prefix coding problem. Existing algorithms which use the package-merge strategy exhibit their poorest performance when the length-restriction, L, is close to H, the longest codeword length appearing in an unrestricted code. We present a package-merge based algorithm for generating minimum-redundancy length-restricted codes which has asymptotic time and space complexity of O((H-L+1) n), where n is the number of symbols in the input. Thus, our algorithm achieves best performance when L is close to H. A point of interest is that the new algorithm first constructs an unrestricted minimum-redundacy code to gain a head-start on the original package-merge algorithm.