Huffman coding


Also found in: Wikipedia.

Huffman coding

(algorithm)
A data compression technique which varies the length of the encoded symbol in proportion to its information content, that is the more often a symbol or token is used, the shorter the binary string used to represent it in the compressed stream. Huffman codes can be properly decoded because they obey the prefix property, which means that no code can be a prefix of another code, and so the complete set of codes can be represented as a binary tree, known as a Huffman tree. Huffman coding was first described in a seminal paper by D.A. Huffman in 1952.

Huffman coding

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.
References in periodicals archive ?
Huffman coding is the basis of almost all compression algorithms.
Liao, "Improving performance of network covert timing channel through Huffman coding," Mathematical and Computer Modelling, vol.
The inner loop quantizes the input vector and increases the quantization step size until the output vector can be coded by Huffman coding with the available amount of bit.
Using the Huffman coding algorithm, OCR process result data are compressed.
In this paper we will experiment with largely used compression methods such as Run Length Encoding, Huffman Coding, Arithmetic Coding, LZW, JPEG, and JPEG2000.
Finally, the encoder produces compressed signal with the help of Huffman coding in .AAC format.
Denic: "Two-stage quantizer with Huffman coding based on G.711 standard", Przeglad Elektrotechniczny (Electrical Review), ISSN 0033-2097, vol.
Huffman coding scheme can also be applied to code word length [L.sup.[xi]] (A) for code word length [N.sub.i]; the average length [L.sup.[xi]] (A) of Huffman code satisfies
The name of "HHSG" was given by an integrated abbreviation of "Huffman coding," "Hilbert curve," "Sudoku puzzle," and "genetic algorithm" because the concepts of these four classical terms were utilized in our proposed scheme.
The quantized coefficients are rearranged in a zigzag or adaptive block scan [19] order to be further compressed by an efficient lossless coding strategy such as run length coding, arithmetic coding, or huffman coding. The decoding is simply the inverse process of encoding.
Fraenkel y Klein (1985) plantearon el metodo LLRUN para comprimir cadenas de bits sparse, mezclando las tecnicas Run Length Encoding (RLE), Elias--Gamma Coding y Huffman Coding.
Further, it is important to remark that the arithmetic coding has a higher computational complexity than the Huffman coding. From the computational complexity perspective, the Huffman coding could be a better option, when the aim is to achieve a SNR above 40 dB.