Adaptive Huffman coding

Known as: Algorithm FGK, FGK algorithm, Algorithm V 
Adaptive Huffman coding (also called Dynamic Huffman coding) is an adaptive coding technique based on Huffman coding. It permits building the code as… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1983-2017
051019832017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Most of the commercial medical image viewers do not provide scalability in image compression and/or encoding/decoding of region… (More)
  • figure 3
  • table 2
  • figure 2
  • table 3
Is this relevant?
2011
2011
In this work we introduce a power-aware adaptive bus encoding method (or simply PABEM) based on Huffman algorithm. PABEM relies… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
There are so many records compression methods have been introduced to shrink the phrasing/data cargo space and communication… (More)
  • table 2
  • table 5
  • table 6
  • table 7
  • table 8
Is this relevant?
2007
2007
XML documents are used for data exchange and to store large amount of data over the Web. These documents are extremely verbose… (More)
  • table 2
Is this relevant?
2006
2006
  • Steven Pigeon Yoshua Bengio
  • 2006
While algorithm M (presented in A Memory-Efficient Huffman Adaptive Coding Algorithm for Very Large Sets of Symbols, by Steven… (More)
Is this relevant?
2005
2005
1Astronomy Department, University of California, Berkeley, CA 94720, USA 2Department of Terrestrial Magnetism, Carnegie… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1998
1998
The problem of computing the minimum redundancy codes as we observe symbols one by one has received a lot of attention. However… (More)
Is this relevant?
1995
1995
This paper presents a new approach to adaptive Huffman coding of 2-D DCT coefficients for image sequence compression. Based on… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Given nonnegative weights (wr, . . . , w,,), the well-known algorithm of Huffman [2] can be used to construct a binary tree with… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1985
1985
We introduce an efficient new algorithm for dynamic Huffman coding, called Algorithm V. It performs one-pass coding and… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?