Constructing Binary Huffman Tree

Okazaki, Hiroyuki; Futa, Yuichi; Shidama, Yasunari

doi:10.2478/forma-2013-0015

Abstract

Huffman coding is one of a most famous entropy encoding methods for lossless data compression [16]. JPEG and ZIP formats employ variants of Huffman encoding as lossless compression algorithms. Huffman coding is a bijective map from source letters into leaves of the Huffman tree constructed by the algorithm. In this article we formalize an algorithm constructing a binary code tree, Huffman tree.

References

[1] Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.
Search in Google Scholar
[2] Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990.
Search in Google Scholar
[3] Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.
Search in Google Scholar
[4] Grzegorz Bancerek. Introduction to trees. Formalized Mathematics, 1(2):421-427, 1990.
Search in Google Scholar
[5] Grzegorz Bancerek. K¨onig’s lemma. Formalized Mathematics, 2(3):397-402, 1991.
Search in Google Scholar
[6] Grzegorz Bancerek. Sets and functions of trees and joining operations of trees. Formalized Mathematics, 3(2):195-204, 1992.
Search in Google Scholar
[7] Grzegorz Bancerek. Joining of decorated trees. Formalized Mathematics, 4(1):77-82, 1993.
Search in Google Scholar
[8] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.
Search in Google Scholar
[9] Grzegorz Bancerek and Piotr Rudnicki. On defining functions on binary trees. Formalized Mathematics, 5(1):9-13, 1996.
Search in Google Scholar
[10] Czesław Bylinski. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529-536, 1990.
Search in Google Scholar
[11] Czesław Bylinski. Functions and their basic properties. Formalized Mathematics, 1(1): 55-65, 1990.
Search in Google Scholar
[12] Czesław Bylinski. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.
Search in Google Scholar
[13] Czesław Bylinski. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.
Search in Google Scholar
[14] Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.
Search in Google Scholar
[15] Krzysztof Hryniewiecki. Recursive definitions. Formalized Mathematics, 1(2):321-328, 1990.
Search in Google Scholar
[16] D. A. Huffman. A method for the construction of minimum-redundancy codes. Proceedings of the I.R.E, 1952.10.1109/JRPROC.1952.273898
Search in Google Scholar
[17] Andrzej Kondracki. Basic properties of rational numbers. Formalized Mathematics, 1(5): 841-845, 1990.
Search in Google Scholar
[18] Andrzej Nedzusiak. σ-fields and probability. Formalized Mathematics, 1(2):401-407, 1990.
Search in Google Scholar
[19] Hiroyuki Okazaki and Yasunari Shidama. Probability on finite set and real-valued random variables. Formalized Mathematics, 17(2):129-136, 2009. doi:10.2478/v10037-009-0014-x.10.2478/v10037-009-0014-x
Search in Google Scholar
[20] Andrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics, 1(1): 115-122, 1990.
Search in Google Scholar
[21] Andrzej Trybulec. Binary operations applied to functions. Formalized Mathematics, 1 (2):329-334, 1990.
Search in Google Scholar
[22] Andrzej Trybulec. On the sets inhabited by numbers. Formalized Mathematics, 11(4): 341-347, 2003.
Search in Google Scholar
[23] Michał J. Trybulec. Integers. Formalized Mathematics, 1(3):501-505, 1990.
Search in Google Scholar
[24] Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.
Search in Google Scholar
[25] Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1 (1):73-83, 1990.
Search in Google Scholar
[26] Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990.
Search in Google Scholar

Constructing Binary Huffman Tree

Abstract

Paradigm

My account