<abstract xmlns="http://www.w3.org/1999/xhtml"><p>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.</p></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.

Constructing Binary Huffman Tree

Japan Advanced Institute of Science and Technology Ishikawa, Japan

This work was supported by JSPS KAKENHI 21240001.

This work was supported by JSPS KAKENHI 22300285.

This research was presented during the 2013 International Conference on Foundations of
Computer Science FCS’13 in Las Vegas, USA.

Formalized Mathematics

{"subtitle":{"sup":"*"},"article-title":"Constructing Binary Huffman Tree"}

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...

Constructing Binary Huffman Tree

Online veröffentlicht: 01. Juni 2013

Seitenbereich: 133 - 143

DOI: https://doi.org/10.2478/forma-2013-0015

Schlüsselwörter
formalization of Huffman coding tree, source coding

This content is open access.

Constructing Binary Huffman Tree

Online veröffentlicht: 01. Juni 2013

Seitenbereich: 133 - 143

DOI: https://doi.org/10.2478/forma-2013-0015

Schlüsselwörterformalization of Huffman coding tree, source coding

This content is open access.

Schlüsselwörter
formalization of Huffman coding tree, source coding