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.
2008
2008
In a text encoded with a Huffman code a bit error can propagate arbitrarily long. This paper introduces a method for limiting… 
2002
2002
We describe a genetic programming system which learns nonlinear predictive models for lossless image compression. Sexpressions… 
2000
2000
  • Yakov Nekritch
  • 2000
  • Corpus ID: 61818198
Huffman codes or minimum-redundancy prefix codes is one of the most widespread compression techniques. Canonical codes are a… 
Highly Cited
1998
Highly Cited
1998
  • Martin BenesS. NowickA. Wolfe
  • 1998
  • Corpus ID: 2586740
This paper presents the architecture and design of a high-performance asynchronous Huffman decoder for compressed-code embedded… 
1998
1998
Summary form only given. Huffman coding has been applied in many disciplines including text compression, still image compression… 
1998
1998
1 Crandall's problem-covering functions Ron Crandall (xrc@aptix.com) posed a problem, which arose in a cryptographic context… 
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… 
1931
1931
The following is an account of an investigation into the role of the enzyme in the succinate-enzyme-fumarate equilibrium. The…