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… 
2007
2007
Introducing probabilistic adaptive mapping developmental genetic programming with redundant mappings
Developmental Genetic Programming (DGP) algorithms have explicitly required the search space for a problem to be divided into… 
2002
2002
Design and VLSI implementation of a digital audio-specific DSP core for MP3/AAC
In this paper, a digital audio-specific DSP core designed for a dual MP3/AAC decoder is presented. The processing core is a 20… 
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… 
2001
2001
A hybrid system for real-time lossless image compression
1999
1999
Subband dictionaries for low-cost matching pursuits of video residues
"Matching pursuits" is a signal expansion technique whose efficiency for video coding has already been largely demonstrated in… 
Highly Cited
1998
Highly Cited
1998
A fast asynchronous Huffman decoder for compressed-code embedded processors
  • Martin BenesS. NowickA. Wolfe
  • Proceedings Fourth International Symposium on…
  • 1998
  • Corpus ID: 2586740
This paper presents the architecture and design of a high-performance asynchronous Huffman decoder for compressed-code embedded… 
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… 
1993
1993
Windowed Huffman coding algorithm with size adaptation
The windowed Huffman algorithm is introduced. The Huffman code tree is constructed based on the probabilities of symbols… 
Highly Cited
1991
Highly Cited
1991
Statistically based buffer control policies for constant rate transmission of compressed digital video
An investigation of statistically based approaches to the design of buffer control algorithms for interfacing a compressed… 
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)