Huffman-coding definition

A relatively simple entropy coding technique that assigns codes to symbols, such as characters in an alphabet, numbers in a numbering scheme, and punctuation marks, with the length of the code corresponding to the probability of the occurrence of the symbol.The technique was developed by David A. Huffman when he was a student at the Massachusetts Institute of Technology (MIT). Huffman coding is the basis for Modified Huffman (MH), a run-length encoding compression technique. See also MH and run-length encoding.
0
0
(computing theory) An entropy-encoding algorithm used for lossless data compression, involving a variable-length code table derived from the estimated probability of occurrence of each symbol (so that more frequent symbols take less space to store).
noun
0
0
Advertisement

Other Word Forms

Noun

Singular:
huffman-coding
Plural:
huffman-codings

Origin of huffman-coding

  • Named after its inventor, David A. Huffman.

    From Wiktionary