Huffman Coding
Huffman Coding is a lossless data compression algorithm that belongs to the class of greedy algorithms, distinguished by its construction of an optimal prefix-free binary code through iteratively merging the two least frequent symbols into a single node until a full binary tree is formed.
688
Publications
35.2K
Citations
1.4K
Authors
626
Institutions
Publications per year
2017–2026
136
Variants
Huffman AlgorithmHuffman Compression
688
Arithmetic coding for data compression
Ian H. Witten, Radford M. Neal, John G. Cleary · Communications of the ACM · 1987 · 2.9K citations · Full text
Hybrid threshold adaptable quantum secret sharing scheme with reverse Huffman-Fibonacci-tree coding
Hong Lai, Jun Zhang, Ming-Xing Luo et al. · Scientific Reports · 2016 · 810 citations · Full text
Computing, Computer Science, Physics +17
Solomon W. Golomb · IEEE Transactions on Information Theory · 1966 · 679 citations
1–5 of 688
1.4K
9
h-index
8
h-index
6
h-index
6
h-index
6
h-index
1–5 of 1.4K
626
AT&T (United States)
Bedminster, United States
12 h-index
15 publications
1.6K citations
University of Southern California
Los Angeles, United States
10 h-index
17 publications
1.4K citations

Bar-Ilan University
Ramat Gan, Israel
9 h-index
13 publications
419 citations
Stanford University
Stanford, United States
8 h-index
10 publications
7.3K citations
National Taiwan University of Science and Technology
Taipei, Taiwan
8 h-index
19 publications
446 citations
IBM (United States)
Armonk, United States
7 h-index
12 publications
1K citations

Northern Illinois University
DeKalb, United States
6 h-index
6 publications
238 citations

The University of Melbourne
Melbourne, Australia
6 h-index
11 publications
433 citations
1–8 of 626
60 publications · 3.9K citations
30
h-index
19 publications · 872 citations
15
h-index
13 publications · 543 citations
13
h-index
10 publications · 351 citations
10
h-index
10 publications · 378 citations
10
h-index
1–5