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

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
The Kepler mission is uniquely suited to study the frequencies of extrasolar planets. This goal requires knowledge of the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Review
2008
Review
2008
ABSTRACT. We analyze 8 years of precise radial velocity measurements from the Keck Planet Search, characterizing the detection… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Review
2006
Review
2006
We discuss our high-precision radial velocity results of a sample of 90 M dwarfs observed with the Hobby-Eberly Telescope and the… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2005
Highly Cited
2005
We report multiple Doppler measurements of five nearby FGK main-sequence stars and subgiants obtained during the past 4-6 yr at… Expand
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 3
Review
2005
Review
2005
We present up-to-date metallicity-dependent temperature versus color calibrations for main-sequence and giant stars based on… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Highly Cited
2002
Highly Cited
1993
Highly Cited
1993
The Huffman code in practice suffers from two problems: the prior knowledge of the probability distribution of the data source to… Expand
Highly Cited
1985
Highly Cited
1985
  • D. Knuth
  • J. Algorithms
  • 1985
  • Corpus ID: 205084575
Abstract This note shows how to maintain a prefix code that remains optimum as the weights change. A Huffman tree with… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
1984
Highly Cited
1984
L'algorithme d'Huffman permet de generer des codes a redondance minimum pour un ensemble fini de message a frequences de… Expand
Highly Cited
1983
Highly Cited
1983
The benefits of strong typing to disciplined programming, tocompile-time error detection and to program verification are… Expand