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.
2017
2017
While the planet-metallicity correlation for FGK main-sequence stars hosting giant planets is well established, the results are… 
2016
2016
Far-infrared excess above the photosphere of a star indicates the presence of a circumstellar dust disc which is a sign-post for… 
2014
2014
We report initial results from our long term search using precision radial velocities for planetary-mass companions located… 
2012
2012
Location-based services (LBSs) have become a popular and important way to provide real-time information and guidance. The abuse… 
2009
2009
Summary In this paper, the focus is on the use of ternary tree over binary tree. First of all, we give the introduction of… 
2009
2009
In this paper, we consider the problem of reconstructing a signal with constant envelope property in the time domain from its… 
2001
2001
Current distributed and multi-database systems are designed to allow timely and reliable access to large amounts of data… 
2001
2001
Semistatic minimum-redundancy prefix (MRP) coding is fast compared with rival coding methods, but requires two passes during… 
Review
2000
Review
2000
Recent developments in the Internet and Web based technologies require faster communication of multimedia data in a secure form…