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
Algorithms for infinite huffman-codes
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Joint source-cryptographic-channel coding for dependable systems
International Journal of Computer Applications in Technology
More efficient algorithms and analyses for unequal letter cost prefix-free coding
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
| Hi-index | 754.84 |
At present, optimal coding for a noiseless digital channel with digits of unequal cost requires solving a large linear programming problem. Much simpler procedures give codes, resembling Shannon's (1948) and Huffman's, that are found close to optimal in tests with typical sources and channels