Abstract
A standard way of implementing Huffman’s optimal code construction algorithm is by using a sorted sequence of frequencies. Several aspects of the algorithm are investigated as to the consequences of relaxing the requirement of keeping the frequencies in order. Using only partial order may speed up the code construction, which is important in some applications, at the cost of increasing the size of the encoded file.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahlswede, R.: Identification entropy. In: Information Transfer and Combinatorics. LNCS, vol. 4123, pp. 595–613 (2006)
Brisaboa, N.R., Fariña, A., Navarro, G., Esteller, M.F.: (s, c)-dense coding: an optimized compression code for natural language text databases. In: Proc. Symposium on String Processing and Information Retrieval SPIRE’03, LNCS, vol. 2857, pp. 122–136 (2003)
Brisaboa, N.R., Iglesias, E.L, Navarro, G., Paramá, J.R: An efficient compression code for text databases. In: Proc. European Conference on Information Retrieval ECIR’03, LNCS, vol. 2633, pp. 468–481 (2003)
Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Technical Report SRC 124, Digital Systems Research Center (1994)
de oura E.S., Navarro G., Ziviani N., Baeza-Yates R.: Fast and flexible word searching on compressed text. ACM Trans. Inf. Syst. 18, 113–139 (2000)
Fraenkel A.S., Klein S.T.: Robust universal complete codes for transmission and compression. Discrete Appl. Math. 64, 31–55 (1996)
Glassey C.R., Karp R.M.: On the optimality of Huffman trees. SIAM J. Appl. Math. 31, 368–378 (1976)
Huffman D.: A method for the construction of minimum redundancy codes. Proc. IRE 40, 1098–1101 (1952)
Katona G.H.O., Nemetz T.O.H.: Huffman codes and self-information. IEEE Trans. Inf. Theory IT–11, 284–292 (1965)
Klein, S.T., Kopel Ben-Nissan, M.: Using Fibonacci compression codes as alternatives to dense codes. In: Proc. Data Compression Conference DCC-2008, pp. 472–481 (2008)
Kullback S., Leibler R.A.: On information and sufficency. Ann. Math. Stat. 22, 79–86 (1951)
Longo G., Galasso G.: An application of informational divergence to Huffman codes. IEEE Trans. Inf. Theory IT–28, 36–43 (1982)
Parker D.S. Jr: Conditions for the optimality of the Huffman algorithm. SIAM J. Comput. 9, 470–489 (1980)
Van Leeuwen, J.: On the construction of Huffman trees. In: Proc. 3rd ICALP Conference, pp. 382–410 (1976)
Véronis, J., Langlais, P.: Evaluation of parallel text alignment systems: the ARCADE project. In: Véronis, J. (ed.) Parallel Text Processing, pp. 369–388 (2000)
Witten I.H., Neal R.M., Cleary J.G.: Arithmetic coding for data compression. Commun. ACM 30, 520–540 (1987)
Yao A.C.C.: An O(|E| log log |V|) algorithm for finding minimum spanning trees. Inf. Process. Lett. 4, 21–23 (1975)
Author information
Authors and Affiliations
Corresponding author
Additional information
This paper has been presented at the Prague Stringology Conference, PSC-2008, Prague, Czech Republic, (2008).
Rights and permissions
About this article
Cite this article
Klein, S.T., Shapira, D. Huffman Coding with Non-Sorted Frequencies. Math.Comput.Sci. 5, 171–178 (2011). https://doi.org/10.1007/s11786-011-0067-4
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11786-011-0067-4