A method for the construction of minimum-redundancy codes

  title={A method for the construction of minimum-redundancy codes},
  author={David A. Huffman},
  • D. Huffman
  • Published 1 September 1952
  • Computer Science, Business
  • Resonance
SummaryAn 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. 

Comment on "Algorithm for Construction of Variable Length Code with Limited Maximum Word Length"

In this correspondence, two algorithms for the construction of a minimum redundancy code have been described and it is pointed out that the strategy in the correspondence does not always lead to an optimal code.

A heuristic algorithm for the construction of a code with limited word length

A depth-first algorithm is presented for the construction of a binary minimum-redundancy variable length code with limited word length. In this algorithm, heuristic information on the mean word

Bounds on Codeword Lengths of Optimal Codes for Noiseless Channels

For the case in which the code alphabet consists of M letters, we derive the optimum probability distribution of a discrete source that assures the minimum average codeword length. For the case of

The number of optimal binary one-ended codes

  • Z. Kukorelly
  • Computer Science
    2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)
  • 2000
Binary prefix-free codes in which all codewords end with "1" are considered. A recursion is given to construct all "optimal" 1-ended codes and to compute the number of such codes with n codewords.

Optimal Universal Coding with Respect to the Maximal Individual Relative Redundancy Criterion

It is proved that, for the set of binary memoryless sources, variable-to-fixed length codes are more efficient than fixed- to-variable length codes if the number of encoded messages is the same.

An algorithm for source coding

This work derives a simple algorithm for the ranking of binary sequences of length n and weight w and uses it for source encoding a memoryless binary source that generates O's and l's with probability p = 1 - q.

Two Corollaries to the Huffman Coding Procedure

For a given set of N symbols to be coded by a code of alphabet size D, the necessary and sufficient conditions for the optimality of a block code of length m, if N = D^m, are stated, and an example of the construction of such a code is given.

On the analysis of variable-to-variable length codes

We simplify the formula for the redundancy of a large class of variable-to-variable length codes on discrete, memoryless sources and find new asymptotic upper bounds on the redundancy of the

Optimum Probability Distribution for Minimum Redundancy of Source Coding

The optimum probability distribution with which the messages should be delivered so that the average redundancy of the source is minimized and the upper bound to these codeword lengths has been found for the case of Huffman encoding.



A device for quantizing, grouping, and coding amplitude-modulated pulses

Thesis (M.S.) Massachusetts Institute of Technology. Dept. of Electrical Engineering, 1949.

A mathematical theory of communication, BellSys

  • Tech-J.,
  • 1948