Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
To understand the formation and evolution of the different stellar populations within our Galaxy it is essential to combine… 
Review
2015
Review
2015
The Transiting Exoplanet Survey Satellite (TESS) is a NASA-sponsored Explorer mission that will perform a wide-field survey for… 
Highly Cited
2012
Highly Cited
2012
Context. We performed a uniform and detailed abundance analysis of 12 refractory elements (Na, Mg, Al, Si, Ca, Ti, Cr, Ni, Co, Sc… 
Review
2011
Review
2011
To understand the formation and evolution of solar-type stars and planets in the solar neighborhood, we need to obtain their… 
Highly Cited
2011
Highly Cited
2011
Context. Empirical libraries of stellar spectra are used to classify stars and synthetize stellar populations. MILES is a medium… 
Review
2010
Review
2010
The location of M dwarfs in the (V - K s ) - M Ks color-magnitude diagram (CMD) has been shown to correlate with metallicity. We… 
1993
1993
The Huffman code in practice suffers from two problems: the prior knowledge of the probability distribution of the data source to… 
Highly Cited
1985
Highly Cited
1985
  • D. Knuth
  • 1985
  • Corpus ID: 205084575
Highly Cited
1985
Highly Cited
1985
Approximate counting is an algorithm proposed by R. Morris which makes it possible to keep approximate counts of large numbers in…