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

Related topics

Related topics

5 relations
Adaptive algorithmAdaptive codingHuffman codingHuffyuv
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
THE FALSE POSITIVE RATE OF KEPLER AND THE OCCURRENCE OF PLANETS
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
The Keck Planet Search: Detectability and the Minimum Mass and Orbital Period Distribution of Extrasolar Planets
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
Exploring the Frequency of Close-in Jovian Planets around M Dwarfs
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
Five New Extrasolar Planets
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
The Effective Temperature Scale of FGK Stars. II. Teff:Color:[Fe/H] Calibrations
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
2002
Algebraic Combinatorics on Words: Index of Notation
Highly Cited
1993
Highly Cited
1993
A fast-adaptive Huffman coding algorithm
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
Dynamic Huffman Coding
  • 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
Algorithms for Adaptive Huffman Codes
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
Polymorphic type inference
The benefits of strong typing to disciplined programming, tocompile-time error detection and to program verification are… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE