Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Huffman coding

Known as: Huffman Code, K-ary Huffman encoding, Huffman Compression algorithm 
In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly used for lossless data… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Neural networks are both computationally intensive and memory intensive, making them difficult to deploy on embedded systems with… Expand
  • figure 1
  • table 6
  • figure 9
  • figure 1
  • table 2
Highly Cited
2010
Highly Cited
2010
Data compression is also called as source coding. It is the process of encoding information using fewer bits than an uncoded… Expand
Highly Cited
2010
Highly Cited
2010
The need for an efficient technique for compression of Images ever increasing because the raw images need large amounts of disk… Expand
Highly Cited
2007
Highly Cited
2007
Selective Huffman coding has recently been proposed for efficient test- data compression with low hardware overhead. In this… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2005
Highly Cited
2005
This paper presents a new chain code based on the eight-direction Freeman code. Each element in the chain is coded as a relative… Expand
  • table 1
  • figure 1
  • table 2
  • figure 2
  • table 4
Highly Cited
2004
Highly Cited
2004
  • K. H. Choi, H. Dai
  • 7th International Symposium on Parallel…
  • 2004
  • Corpus ID: 18565075
In (distributed) denial of service attack ((D)DoS), attackers send a huge number of packets with spoofed source addresses to… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 4
  • figure 7
Highly Cited
1997
Highly Cited
1997
Gridded fields (analyses) of global monthly precipitation have been constructed on a 2.5° latitude–longitude grid for the 17-yr… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1987
Highly Cited
1987
The state of the art in data compression is arithmetic coding, not the better-known Huffman method. Arithmetic coding gives… Expand
  • table I
  • figure 1
  • figure 2
  • figure 4
  • figure 4
Highly Cited
1984
Highly Cited
1984
Arithmetic coding is a data compression technique that encodes data (the data string) by creating a code string which represents… Expand
Highly Cited
1978
Highly Cited
1978
  • R. Gallager
  • IEEE Trans. Inf. Theory
  • 1978
  • Corpus ID: 2033521
In honor of the twenty-fifth anniversary of Huffman coding, four new results about Huffman codes are presented. The first result… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5