Abstract
There is a large literature devoted to the problem of finding an optimal (min-cost) prefix-free code with an unequal letter-cost encoding alphabet of size. While there is no known polynomial time algorithm for optimally solving it, there are many good heuristics that all provide additive errors to optimal. The additive error in these algorithms usually depends linearly upon the size of the largest encoding letter.
This paper was motivated by the problem of finding optimal codes when the encoding alphabet is infinite. Because the largest letter cost is infinite, the previous analyses could give infinite error bounds. We provide a new algorithm that works with infinite encoding alphabets. When restricted to the finite alphabet case, our algorithm often provides better error bounds than the best previous ones known.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abrahams, J.: Code and parse trees for lossless source encoding. Communications in Information and Systems 1(2), 113–146 (2001)
Altenkamp, D., Melhorn, K.: Codes: Unequal probabilies, unequal letter costs. Journal of the Association for Computing Machinery 27(3), 412–427 (1980)
Berger, T., Yeung, R.W.: Optimum ’1’ ended binary prefix codes. IEEE Transactions on Information Theory 36(6), 1435–1441 (1990)
Blachman, N.M.: Minimum cost coding of information. IRE Transactions on Information Theory PGIT-3, 139–149 (1954)
Bradford, P., Golin, M., Larmore, L.L., Rytter, W.: Optimal prefix-free codes for unequal letter costs and dynamic programming with the monge property. Journal of Algorithms 42, 277–303 (2002)
Capocelli, R.M., De Santis, A., Persiano, G.: Binary prefix codes ending in a ”1”. IEEE Transactions on Information Theory 40(4), 1296–1302 (1994)
Cott, N.: Characterization and Design of Optimal Prefix Codes. PhD Thesis, Stanford University, Department of Computer Science (June 1977)
Csisz’ar, I.: Simple proofs of some theorems on noiseless channels. Inform. Contr. 514, 285–298 (1969)
Gilbert, E.N.: Coding with digits of unequal costs. IEEE Trans. Inform. Theory 41, 596–600 (1995)
Golin, M., Rote, G.: A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs. IEEE Transactions on Information Theory 44(5), 1770–1781 (1998)
Golin, M., Jian, L.: More efficient algorithms and analyses for unequal letter cost prefix-free coding (2007), available at http://arxiv.org/abs/0705.0253
Golin, M.J., Kenyon, C., Young, N.E.: Huffman coding with unequal letter costs. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002), pp. 785–791 (2002)
Huffman, D.A.: A method for the construction of minimum redundancy codes. In: Proc. IRE 40, vol. 10, pp. 1098–1101 (September 1952)
Itai, I.: Optimal alphabetic trees. SIAM J. Computing 5, 9–18 (1976)
Karp, R.: Minimum-redundancy coding for the discrete noiseless channel. IRE Transactions on Information Theory IT-7, 27–39 (1961)
Krause, R.M.: Channels which transmit letters of unequal duration. Inform. Contr. 5, 13–24 (1962)
Marcus, R.S.: Discrete Noiseless Coding. M.S. Thesis, MIT E.E. Dept (1957)
Mehlhorn, K.: An efficient algorithm for constructing nearly optimal prefix codes. IEEE Trans. Inform. Theory 26, 513–517 (1980)
Patt, Y.N.: Variable length tree structures having minimum average search time. Commun. ACM 12(2), 72–76 (1969)
Shannon, C.E.: A mathematical theory of communication. The Bell System Technical Journal 27, 379–423 623–656 (1948)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Golin, M., Li, J. (2007). More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding. In: Tokuyama, T. (eds) Algorithms and Computation. ISAAC 2007. Lecture Notes in Computer Science, vol 4835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77120-3_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-77120-3_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77118-0
Online ISBN: 978-3-540-77120-3
eBook Packages: Computer ScienceComputer Science (R0)