Abstract

An optimum method of coding an ensemble of messages consisting of a finite number of members is developed. A minimum-redundancy code is one constructed in such a way that the average number of coding digits per message is minimized.

Keywords

Redundancy (engineering)Coding (social sciences)Computer scienceAlgorithmVariable-length codeTheoretical computer scienceMathematicsDecoding methodsStatistics

Affiliated Institutions

Related Publications

A recursive approach to low complexity codes

A method is described for constructing long error-correcting codes from one or more shorter error-correcting codes, referred to as subcodes, and a bipartite graph. A graph is sh...

1981 IEEE Transactions on Information Theory 3080 citations

Geometrically uniform codes

A signal space code C is defined as geometrically uniform if, for any two code sequences in C, there exists an isometry that maps one sequence into the other while leaving the c...

1991 IEEE Transactions on Information Theory 450 citations

Publication Info

Year
1952
Type
article
Volume
40
Issue
9
Pages
1098-1101
Citations
6175
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

6175
OpenAlex

Cite This

David A. Huffman (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

Identifiers

DOI
10.1109/jrproc.1952.273898