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

Related topics

Related topics

50 relations
A Mathematical Theory of CommunicationAdaptive Binary OptimizationAdaptive Huffman codingBinary tree
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Huffman Coding-Based Adaptive Spatial Modulation
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
Deep Compression: Compressing Deep Neural Network with Pruning, Trained Quantization and Huffman Coding
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
Optimal Selective Huffman Coding for Test-Data Compression
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
An efficient chain code with Huffman coding
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
Parallel Huffman Decoding with Applications to JPEG Files
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
Is Huffman coding dead?
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
Arithmetic Coding for Data Compression
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
Design and analysis of dynamic Huffman codes
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
Variations on a theme by Huffman
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
Generalized Kraft Inequality and Arithmetic Coding
Algorithms for encoding and decoding finite strings over a finite alphabet are described. The coding operations are arithmetic… (More)
Is this relevant?