Skip to search form
Skip to main content
>
Semantic Scholar
Semantic Scholar's Logo
Search
Sign In
Create Free Account
You are currently offline. Some features of the site may not work correctly.
Huffman coding
Known as:
Huffman Code
, K-ary Huffman encoding
, Huffman Compression algorithm
Expand
In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly used for lossless data…
Expand
Wikipedia
Create Alert
Related topics
Related topics
50 relations
A Mathematical Theory of Communication
Adaptive Binary Optimization
Adaptive Huffman coding
Binary tree
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Deep Compression: Compressing Deep Neural Network with Pruning, Trained Quantization and Huffman Coding
Song Han
,
Huizi Mao
,
W. Dally
ICLR
2016
Corpus ID: 2134321
Neural networks are both computationally intensive and memory intensive, making them difficult to deploy on embedded systems with…
Expand
Highly Cited
2010
Highly Cited
2010
Compression Using Huffman Coding
M. Sharma
2010
Corpus ID: 62453250
Data compression is also called as source coding. It is the process of encoding information using fewer bits than an uncoded…
Expand
Highly Cited
2010
Highly Cited
2010
A NEW LOSSLESS METHOD OF IMAGE COMPRESSION AND DECOMPRESSION USING HUFFMAN CODING TECHNIQUES
Jagadish H. Pujar
,
Lohit M. Kadlaskar
2010
Corpus ID: 2766609
The need for an efficient technique for compression of Images ever increasing because the raw images need large amounts of disk…
Expand
Highly Cited
2007
Highly Cited
2007
Optimal Selective Huffman Coding for Test-Data Compression
X. Kavousianos
,
E. Kalligeros
,
D. Nikolos
IEEE Transactions on Computers
2007
Corpus ID: 8723574
Selective Huffman coding has recently been proposed for efficient test- data compression with low hardware overhead. In this…
Expand
Highly Cited
2005
Highly Cited
2005
An efficient chain code with Huffman coding
Y. K. Liu
,
B. Zalik
Pattern Recognit.
2005
Corpus ID: 207320155
This paper presents a new chain code based on the eight-direction Freeman code. Each element in the chain is coded as a relative…
Expand
Highly Cited
2004
Highly Cited
2004
A marking scheme using Huffman codes for IP traceback
K. H. Choi
,
H. Dai
7th International Symposium on Parallel…
2004
Corpus ID: 18565075
In (distributed) denial of service attack ((D)DoS), attackers send a huge number of packets with spoofed source addresses to…
Expand
Highly Cited
1997
Highly Cited
1997
Global Precipitation: A 17-Year Monthly Analysis Based on Gauge Observations, Satellite Estimates, and Numerical Model Outputs
P. Xie
,
P. Arkin
1997
Corpus ID: 43741969
Gridded fields (analyses) of global monthly precipitation have been constructed on a 2.5° latitude–longitude grid for the 17-yr…
Expand
Highly Cited
1987
Highly Cited
1987
Arithmetic coding for data compression
I. Witten
,
R. Neal
,
J. Cleary
CACM
1987
Corpus ID: 3343393
The state of the art in data compression is arithmetic coding, not the better-known Huffman method. Arithmetic coding gives…
Expand
Highly Cited
1984
Highly Cited
1984
An Introduction to Arithmetic Coding
G. Langdon
IBM J. Res. Dev.
1984
Corpus ID: 12940080
Arithmetic coding is a data compression technique that encodes data (the data string) by creating a code string which represents…
Expand
Highly Cited
1978
Highly Cited
1978
Variations on a theme by Huffman
R. Gallager
IEEE Trans. Inf. Theory
1978
Corpus ID: 2033521
In honor of the twenty-fifth anniversary of Huffman coding, four new results about Huffman codes are presented. The first result…
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