论文信息 - Length-limited coding

Length-limited coding

An 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 0 (nLlogn)-time algorithm is given for the corresponding alphabetic problem, which is equivalent to optimizing a dictionary of n words, implemented as a binary tree of height h I: L with all data in the leaves.

Lawrence L. Larmore | Daniel S. Hirschberg | L. Larmore | D. Hirschberg

[1] T. C. Hu,et al. Path Length of Binary Search Trees. , 1972 .

[2] David A. Huffman,et al. A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

[3] Alon Itai,et al. Optimal Alphabetic Trees , 1976, SIAM J. Comput..

[4] Daniel S. Hirschberg,et al. A linear space algorithm for computing maximal common subsequences , 1975, Commun. ACM.

[5] T. C. Hu,et al. Optimal Computer Search Trees and Variable-Length Alphabetical Codes , 1971 .

[6] LAWRENCE L. LARMORE. Height Restricted Optimal Binary Trees , 1987, SIAM J. Comput..

[7] Russell L. Wessner. Optimal Alphabetic Search Trees With Restricted Maximal Height , 1976, Inf. Process. Lett..

[8] M. R. Garey,et al. Optimal Binary Search Trees with Restricted Maximal Depth , 1974, SIAM J. Comput..

[9] D. Huffman. A Method for the Construction of Minimum-Redundancy Codes , 1952 .