A Method for the Construction of Minimum-Redundancy Codes

Huffman, D. (1952). A Method for the Construction of Minimum-Redundancy Codes. Proceedings of the Institute of Radio Engineers, 40(9), 1098-1101.

Type

Journal article

Intellectual base

Primary research

Year

1952

DOI

10.1109/jrproc.1952.273898

Link

https://doi.org/10.1109/JRPROC.1952.273898

Cited from

information_theory, philosophy

Cited by

3 citations across 3 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Compression
  • and its statistical or structural properties; (2) the loss discipline — lossless (exact reconstruction, bounded by entropy) or lossy (controlled fidelity loss, subject to distortion-rate tradeoffs); (3) the algorithm — entropy coding (Huffman, arithmetic, ANS)

    This sourceThe optimal prefix-code (Huffman) construction by greedy bottom-up merging of lowest-probability symbols. SUPPORTS markers 168 (canonical reference, Notes), 170 (entropy coding: Huffman), and 172 (Huffman's 1952 prefix code). DOI verified.

• Parsimony (Occam's Razor)
  • Complexity measure: Kolmogorov complexity K(h) — the length of the shortest description of h. (Related to classical compression methods

    This sourceHuffman optimal prefix-code algorithm.

Domain-specific

• Variable-Length Encoding
  • Huffman's primary result gives a canonical example of variable-length design, but Variable-Length Encoding is broader than Huffman Coding.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:d01d245e24cc · see in the full table