Paper Info
Title
Constructing Binary Huffman Tree
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.
Year
DOI
Venue
2013
10.2478/forma-2013-0015
FORMALIZED MATHEMATICS
Keywords
Field
DocType
formalization of Huffman coding tree, source coding
Tunstall coding,Source code,Theoretical computer science,Huffman coding,Shannon–Fano coding,Mathematics,Binary number,Variable-length code,Canonical Huffman code
Journal
Volume
Issue
ISSN
21
2
1898-9934
Citations 
PageRank 
References 
0
0.34
0
Authors
3
Name
Order
Citations
PageRank
Hiroyuki Okazaki100.34
Yuichi Futa22315.08
Yasunari Shidama316672.47