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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Antenna switch enables multiple antennas to share a common RF chain. It also offers an additional spatial dimension, i.e… (More)
  • figure 1
  • table II
  • table I
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2016
Highly Cited
2016
Neural networks are both computationally intensive and memory intensive, making them difficult to deploy on embedded systems with… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Selective Huffman coding has recently been proposed for efficient test- data compression with low hardware overhead. In this… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
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… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
  • table 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
A simple parallel algorithm for decoding a Huffman encoded file is presented, exploiting the tendency of Huffman codes to… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
1993
1993
In recent publications about data compression, arithmetic codes are often suggested as the state of the art, rather than the more… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • figure 1
Is this relevant?
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… (More)
  • table I
  • figure 1
  • figure 2
  • figure 4
  • figure 4
Is this relevant?
Highly Cited
1987
Highly Cited
1987
A new one-pass algorithm for constructing dynamic Huffman codes is introduced and analyzed. We also analyze the one-pass… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Abstruct-In honor of the twenty-fifth amdversary of Huffman coding, four new results about Huffman codes are presented. 'Ibe… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1976
Highly Cited
1976
Algorithms for encoding and decoding finite strings over a finite alphabet are described. The coding operations are arithmetic… (More)
Is this relevant?