Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,355,006 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
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
2010
Highly Cited
2010
Compression Using Huffman Coding
Mamta 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
2009
Highly Cited
2009
Explicit construction of optimal exact regenerating codes for distributed storage
K. V. Rashmi
,
Nihar B. Shah
,
P. Vijay Kumar
,
K. Ramchandran
Allerton Conference on Communication, Control…
2009
Corpus ID: 6393201
Erasure coding techniques are used to increase the reliability of distributed storage systems while minimizing storage overhead…
Expand
Highly Cited
2009
Highly Cited
2009
Repeated Reading Interventions for Students with Learning Disabilities: Status of the Evidence
D. Chard
,
L. Ketterlin-Geller
,
S. Baker
,
Christian T. Doabler
,
Chanisa Apichatabutra
2009
Corpus ID: 67810739
For students with or at risk for learning disabilities, developing fluency with reading connected texts remains a formidable…
Expand
Review
2009
Review
2009
Teaching science with technology: Case studies of science teachers’ development of technology, pedagogy, and content knowledge
S. Guzey
,
G. Roehrig
2009
Corpus ID: 18073181
This study examines the development of technology, pedagogy, and content knowledge (TPACK) in four in-service secondary science…
Expand
Highly Cited
2006
Highly Cited
2006
Secret image sharing with smaller shadow images
Ran-Zan Wang
,
Chin-Hui Su
Pattern Recognition Letters
2006
Corpus ID: 27314883
Highly Cited
2004
Highly Cited
2004
Efficient, low-complexity image coding with a set-partitioning embedded block coder
W. Pearlman
,
A. Islam
,
N. Nagaraj
,
A. Said
IEEE transactions on circuits and systems for…
2004
Corpus ID: 347171
We propose an embedded, block-based, image wavelet transform coding algorithm of low complexity. It uses a recursive set…
Expand
Highly Cited
2000
Highly Cited
2000
Infrared Spectral Evidence for the Etching of Carbon Nanotubes: Ozone Oxidation at 298 K
D. Mawhinney
,
V. Naumenko
,
A. Kuznetsova
,
J. Yates
,
J. And
,
R. Smalley
2000
Corpus ID: 97248516
Single-walled nanotubes (SWNTs) are an interesting new molecular form of carbon in the fullerene family, first reported by Iijima…
Expand
Review
1998
Review
1998
Error-resilient video coding in the ISO MPEG-4 standard
R. Talluri
IEEE Communications Magazine
1998
Corpus ID: 14186070
This article describes error resilience aspects of the video coding techniques that are standardized in the ISO MPEC-4 standard…
Expand
Highly Cited
1992
Highly Cited
1992
Self-assembly of the fullerenes
R. Smalley
1992
Corpus ID: 55329863
The account deals with a central mystery of the fullerene story: How are they made How can the fullerenes in general, and C[sub…
Expand
Highly Cited
1984
Highly Cited
1984
Self-synchronizing Huffman codes
Thomas J. Ferguson
,
J. H. Rabinowitz
IEEE Transactions on Information Theory
1984
Corpus ID: 29812089
A problem associated with the use of variable-length source codes is that loss of synchronization may lead to extended errors in…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE