Skip to search formSkip to main contentSkip to account menu

Huffman coding

Known as: Huffman Code, K-ary Huffman encoding, Huffman Compression algorithm 
In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly used for lossless data… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Data compression is also called as source coding. It is the process of encoding information using fewer bits than an uncoded… 
Highly Cited
2009
Highly Cited
2009
Erasure coding techniques are used to increase the reliability of distributed storage systems while minimizing storage overhead… 
Highly Cited
2009
Highly Cited
2009
For students with or at risk for learning disabilities, developing fluency with reading connected texts remains a formidable… 
Review
2009
Review
2009
This study examines the development of technology, pedagogy, and content knowledge (TPACK) in four in-service secondary science… 
Highly Cited
2004
Highly Cited
2004
We propose an embedded, block-based, image wavelet transform coding algorithm of low complexity. It uses a recursive set… 
Highly Cited
2000
Highly Cited
2000
Single-walled nanotubes (SWNTs) are an interesting new molecular form of carbon in the fullerene family, first reported by Iijima… 
Review
1998
Review
1998
This article describes error resilience aspects of the video coding techniques that are standardized in the ISO MPEC-4 standard… 
Highly Cited
1992
Highly Cited
1992
The account deals with a central mystery of the fullerene story: How are they made How can the fullerenes in general, and C[sub… 
Highly Cited
1984
Highly Cited
1984
A problem associated with the use of variable-length source codes is that loss of synchronization may lead to extended errors in…