Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,724,516 papers from all fields of science
Search
Sign In
Create Free Account
Huffman coding
Known as:
Huffman Code
, K-ary Huffman encoding
, Huffman Compression algorithm
Expand
In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly used for lossless data…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
A Mathematical Theory of Communication
Adaptive Binary Optimization
Adaptive Huffman coding
Binary tree
Expand
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
J. Nakajima
,
Misako Takahashi
,
T. Seto
,
Jin Suzuki
Forensic Toxicology
2010
Corpus ID: 22755172
During our careful survey of unregulated drugs in Tokyo, a new compound was disclosed as an adulterant in herbal and powder…
Expand
Highly Cited
2006
Highly Cited
2006
A Lossless Data Compression and Decompression Algorithm and Its Hardware Architecture
Ming-Bo Lin
,
Jang-Feng Lee
,
G. Jan
IEEE Transactions on Very Large Scale Integration…
2006
Corpus ID: 14086351
In this paper, we propose a new two-stage hardware architecture that combines the features of both parallel dictionary LZW (PDLZW…
Expand
Highly Cited
2005
Highly Cited
2005
A Carbene-Stabilized Gold(I) Fluoride: Synthesis and Theory
D. Laitar
,
P. Müller
,
Thomas G. Gray
,
J. Sadighi
2005
Corpus ID: 96304121
The first isolable gold(I) fluoride complex, stabilized by an N-heterocyclic carbene (NHC) ligand, has been isolated in two…
Expand
Highly Cited
2004
Highly Cited
2004
Technology Learning Principles for Preservice and In-service Teacher Education
Joan E. Hughes
2004
Corpus ID: 154559329
This essay presents a vision for technology integration in teacher education that develops teachers into “technology…
Expand
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…
Expand
Highly Cited
2001
Highly Cited
2001
On constructing the Huffman-code-based reversible variable-length codes
Chien-Wu Tsai
,
Ja-Ling Wu
IEEE Transactions on Communications
2001
Corpus ID: 6967695
In this letter, we propose a generic and efficient algorithm that can construct both asymmetrical and symmetrical reversible…
Expand
Highly Cited
1996
Highly Cited
1996
On breaking a Huffman code
David W. Gillman
,
M. Mohtashemi
,
R. Rivest
IEEE Transactions on Information Theory
1996
Corpus ID: 17728315
We examine the problem of deciphering a file that has been Huffman coded, but not otherwise encrypted. We find that a Huffman…
Expand
1996
1996
Huffman coding with an infinite alphabet
A. Kato
,
T. Han
,
H. Nagaoka
IEEE Transactions on Information Theory
1996
Corpus ID: 32413621
A new type of sufficient condition is provided for a probability distribution on the nonnegative integers to be given an optimal…
Expand
1995
1995
A parallel decoder of programmable Huffman codes
Belle W. Y. Wei
,
T. Meng
IEEE Trans. Circuits Syst. Video Technol.
1995
Corpus ID: 5092813
Huffman coding, a variable-length entropy coding scheme, is an integral component of international standards on image and video…
Expand
Highly Cited
1973
Highly Cited
1973
A Huffman-Shannon-Fano code
J. B. Connell
1973
Corpus ID: 61740782
A variable-word-length minimum-redundant code is described. It has the advantages of both the Huffman and Shannon-Fano codes in…
Expand
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)
ACCEPT & CONTINUE