Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters

Authors:
Y. Perl;M. R. Garey;S. Even
Affiliations:
Department of Applied Mathematics, The Weizmann Institute of Science, Rehovot, Israel;Bell Laboratories, Murray Hill, NJ;Department of Computer Science, Technion, Haifa, Israel and The Weizmann Institute of Science, Rehovot, Israel
Venue:
Journal of the ACM (JACM)
Year:
1975

Citing 1
Cited 7

Algorithm 245: Treesort

Communications of the ACM

Data compression

ACM Computing Surveys (CSUR)
Codes: Unequal Probabilities, Unequal Letter Cost

Journal of the ACM (JACM)
Huffman coding with unequal letter costs

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Optimal Prefix-Free Codes that end in a Specified Pattern and Similar Problems: The Uniform Probability Case (Extended Abstract)

DCC '01 Proceedings of the Data Compression Conference
Silence-based communication

IEEE Transactions on Information Theory
The structure of optimal prefix-free codes in restricted languages: the uniform probability case

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.06

Visualization

Abstract