Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,110,138 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
2007
2007
Introducing probabilistic adaptive mapping developmental genetic programming with redundant mappings
G. Wilson
,
M. Heywood
Genetic Programming and Evolvable Machines
2007
Corpus ID: 10679580
Developmental Genetic Programming (DGP) algorithms have explicitly required the search space for a problem to be divided into…
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
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
2001
2001
A hybrid system for real-time lossless image compression
G. W. Drost
,
N. Bourbakis
,
N. Bourbakis
Microprocessors and microsystems
2001
Corpus ID: 1392015
2000
2000
Transmit diversity schemes for broadband mobile communication systems
F. Vook
,
T. Thomas
Vehicular Technology Conference Fall . IEEE VTS…
2000
Corpus ID: 61410356
This paper considers the problem of incorporating orthogonal space-time block coding in broadband wireless communication systems…
Expand
Highly Cited
1998
Highly Cited
1998
A fast asynchronous Huffman decoder for compressed-code embedded processors
Martin Benes
,
S. Nowick
,
A. 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…
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
1993
1993
Windowed Huffman coding algorithm with size adaptation
H.‐C. Huang
,
Ja-Ling Wu
1993
Corpus ID: 53668951
The windowed Huffman algorithm is introduced. The Huffman code tree is constructed based on the probabilities of symbols…
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