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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Neural networks are both computationally intensive and memory intensive, making them difficult to deploy on embedded systems with… 
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
2010
Highly Cited
2010
The need for an efficient technique for compression of Images ever increasing because the raw images need large amounts of disk… 
Highly Cited
1997
Highly Cited
1997
Gridded fields (analyses) of global monthly precipitation have been constructed on a 2.5° latitude–longitude grid for the 17-yr… 
Review
1991
Review
1991
Preface to the Second Edition. Preface to the First Edition. Acknowledgments for the Second Edition. Acknowledgments for the… 
Highly Cited
1987
Highly Cited
1987
The state of the art in data compression is arithmetic coding, not the better-known Huffman method. Arithmetic coding gives… 
Highly Cited
1984
Highly Cited
1984
Arithmetic coding is a data compression technique that encodes data (the data string) by creating a code string which represents… 
Highly Cited
1978
Highly Cited
1978
  • R. Gallager
  • IEEE Trans. Inf. Theory
  • 1978
  • Corpus ID: 2033521
In honor of the twenty-fifth anniversary of Huffman coding, four new results about Huffman codes are presented. The first result… 
Highly Cited
1977
Highly Cited
1977
Highly Cited
1955
Highly Cited
1955
The theoretical basis of sequential circuit synthesis is developed, with particular reference to the work of D. A. Huffman and E…