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)

Related topics

Related topics

50 relations
A Mathematical Theory of CommunicationAdaptive Binary OptimizationAdaptive Huffman codingBinary tree

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2010
Review
2010
Identification and quantitation of cannabimimetic compound JWH-250 as an adulterant in products obtained via the Internet
During our careful survey of unregulated drugs in Tokyo, a new compound was disclosed as an adulterant in herbal and powder… 
Highly Cited
2006
Highly Cited
2006
A Lossless Data Compression and Decompression Algorithm and Its Hardware Architecture
In this paper, we propose a new two-stage hardware architecture that combines the features of both parallel dictionary LZW (PDLZW… 
Highly Cited
2005
Highly Cited
2005
A Carbene-Stabilized Gold(I) Fluoride: Synthesis and Theory
The first isolable gold(I) fluoride complex, stabilized by an N-heterocyclic carbene (NHC) ligand, has been isolated in two… 
2005
2005
A tree-structured index allocation method with replication over multiple broadcast channels in wireless environments
Broadcast has often been used to disseminate frequently requested data efficiently to a large volume of mobile units over single… 
2004
2004
Optimal Huffman coding of DCT blocks
  • G. Lakhani
  • IEEE transactions on circuits and systems for…
  • 2004
  • Corpus ID: 1636472
It is a well-observed characteristic that, when a discrete cosine transform block is traversed in the zigzag order, ac… 
Highly Cited
2004
Highly Cited
2004
FPGA-based implementation of recursive algorithms
Highly Cited
2001
Highly Cited
2001
On constructing the Huffman-code-based reversible variable-length codes
In this letter, we propose a generic and efficient algorithm that can construct both asymmetrical and symmetrical reversible… 
1995
1995
A parallel decoder of programmable Huffman codes
Huffman coding, a variable-length entropy coding scheme, is an integral component of international standards on image and video… 
1990
1990
DCT coding for motion video storage using adaptive arithmetic coding
Highly Cited
1973
Highly Cited
1973
A Huffman-Shannon-Fano code
A variable-word-length minimum-redundant code is described. It has the advantages of both the Huffman and Shannon-Fano codes in… 
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)