Users Also Read
MCQ's Search Engine
Electrical Engineering
Mechanical Engineering
Civil Engineering
Automobile Engineering
Chemical Engineering
Computer Engineering
Electronics Engineering
Medical Science Engg
All Engineering Dictionary Terms
Definition of "Huffman coding" |
(1) a method for lossless source coding that constructs the code of minimum average length for a random variable. The method is optimal in the sense that no other method can give a higher compression rate. It is capable of achieving the bound on compression given by the source coding theorem. It is due to D. A. Huffman (1952).(2) a variable length coding scheme whose codewords are generated from the probability distribution of the source. Decoding a Huffman codeword corresponds to traversing an unbalanced binary tree according to the value (0 or 1) of each bit in the word; the leaves of the tree are the source symbols, with the most probable ones being the shortest distance from the root of the tree. Huffman coding achieves an average code rate equal to the source entropy if and only if all the probabilities are negative powers of 2. In general it achieves less compression than arithmetic coding but is easier to implement. |
Please type any word or choose alphabet below... |
A
B
C
D
E
F
G
H
I
J
K
L
M N O P Q R S T U V W X Y Z 1 2 3 4 5 6 7 8 9 0 |