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.
Review
2010
Review
2010
During our careful survey of unregulated drugs in Tokyo, a new compound was disclosed as an adulterant in herbal and powder… 
2008
2008
In a text encoded with a Huffman code a bit error can propagate arbitrarily long. This paper introduces a method for limiting… 
2008
2008
Several numerical methods have been suggested in the past to compute the outage probability and the ergodic capacity of an… 
2002
2002
We describe a genetic programming system which learns nonlinear predictive models for lossless image compression. Sexpressions… 
2000
2000
The advantages of Hyperspectral Imaging (HSI) over conventional remote sensing imaging has been well recognized (Schowengerdt… 
1997
1997
  • Martin BenesA. WolfeS. Nowick
  • 1997
  • Corpus ID: 15244508
This paper describes the architecture and implementation of a high-speed decompression engine for embedded processors. The engine… 
1995
1995
The article presents new tables for Huffman encoding of still images. Experimental results indicate that tables lead to an… 
1995
1995
The objective of this study was to investigate pollution prevention (P2) opportunities in the textile wet processing industry… 
1985
1985
Abstract : Radar pulse compression waveforms usually consist of constant amplitude signals whose phase or frequency is varied to… 
1931
1931
The following is an account of an investigation into the role of the enzyme in the succinate-enzyme-fumarate equilibrium. The…