Construct · 1 fields · 1 citations

Huffman coding: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Information theory

building an optimal prefix code by repeatedly merging the two least probable symbols.

In information theory, Huffman coding refers to building an optimal prefix code by repeatedly merging the two least probable symbols. This meaning comes from Huffman (1952) in Proceedings of the IRE.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Huffman coding sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

code3 fields · 6 citationsjingle · one word, three constructs greedy algorithm1 fields · 1 citationsanchor · one construct, one field information4 fields · 5 citationsjingle · one word, four constructs

References

Huffman, D. (1952). A Method for the Construction of Minimum-Redundancy Codes. Proceedings of the IRE, 40(9), 1098-1101. https://doi.org/10.1109/jrproc.1952.273898

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct