Huffman-coding definitions

A statistical compression method that converts characters into variable length bit strings. Most-frequently occurring characters are converted to shortest bit strings; least frequent, the longest. Compression takes two passes. The first pass analyzes a block of data and creates a tree model based on its contents. The second pass compresses the data via the model. Decompression decodes the variable length strings via the tree. See LZW.
0
0
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

Origin of huffman-coding

Named after its inventor, David A. Huffman.