Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,067,605 papers from all fields of science
Search
Sign In
Create Free Account
Adaptive Huffman coding
Known as:
Algorithm FGK
, FGK algorithm
, Algorithm V
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Adaptive algorithm
Adaptive coding
Huffman coding
Huffyuv
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Image Compression using Discrete Cosine Transform and Adaptive Huffman Coding
D. Jain
,
Devansh Gaur
,
Kavya Gaur
,
Neha Jain
2014
Corpus ID: 212535565
: Image Compression means reducing the volume of data needed in order to represent an Image. Image compression techniques are…
Expand
2014
2014
Empirical Limits on Radial Velocity Planet Detection for Young Stars
L. Hillenbrand
,
H. Isaacson
,
G. Marcy
,
S. Barenfeld
,
D. Fischer
,
A. Howard
2014
Corpus ID: 54804746
We report initial results from our long term search using precision radial velocities for planetary-mass companions located…
Expand
2012
2012
Privacy Preserving for Continuous Query in Location Based Services
Y. Wang
,
Long-Ping He
,
Jing Peng
,
Ting-ting Zhang
,
Hong-Zong Li
IEEE 18th International Conference on Parallel…
2012
Corpus ID: 9288059
Location-based services (LBSs) have become a popular and important way to provide real-time information and guidance. The abuse…
Expand
2011
2011
Protein Sequence Motif Extraction Using Decision Forest
Bernard Chen
,
Cody L. Hudson
,
Minwoo Kim
,
Aaron Crawford
,
John R. Wright
,
Dongsheng Che
2011
Corpus ID: 15128502
— As one of the more prominent areas of bioinformatics research, protein sequence analysis has gathered considerable interest…
Expand
2009
2009
Ternary Tree & FGK Huffman Coding Technique
Madhu Goel
2009
Corpus ID: 3171666
Summary In this paper, the focus is on the use of ternary tree over binary tree. First of all, we give the introduction of…
Expand
2009
2009
Reconstruction of constant envelope signals with given Fourier transform magnitude
S. Pillai
,
Ke-Yong Li
,
H. Beyer
International Radar Conference
2009
Corpus ID: 20650291
In this paper, we consider the problem of reconstructing a signal with constant envelope property in the time domain from its…
Expand
2004
2004
Cellular Mobile Network Simulation with CDMAnet
G. Grozev
,
S. Foo
,
C. Mcnamara
2004
Corpus ID: 18781704
This paper introduces a simulation approach to the object-oriented modelling of CDMA cellular mobile networks implemented in the…
Expand
2001
2001
On-line adaptive canonical prefix coding with bounded compression loss
A. Turpin
,
Alistair Moffat
IEEE Transactions on Information Theory
2001
Corpus ID: 7626553
Semistatic minimum-redundancy prefix (MRP) coding is fast compared with rival coding methods, but requires two passes during…
Expand
2001
2001
Transaction Processing in a Mobile, Multi-Database Environment
James B. Lim
,
A. Hurson
Multimedia tools and applications
2001
Corpus ID: 33944414
Current distributed and multi-database systems are designed to allow timely and reliable access to large amounts of data…
Expand
Review
2000
Review
2000
Secure compression using adaptive Huffman coding
C. Kailasananathan
,
R. Safavi-Naini
,
P. Ogunbona
2000
Corpus ID: 56233161
Recent developments in the Internet and Web based technologies require faster communication of multimedia data in a secure form…
Expand