“Huffman encoding”的概念、定义、翻译、参考文献-科学参考

Huffman encoding

Computer

A (usually) binary encoding of the elements of a finite set, A,
$A = {a_{1}, a_{2}, \dots, a_{n}}$
where each element a_i in A has an assumed probability, p_i, of occurring in a message. The binary encoding satisfies the prefix property and is such that messages will have a minimum expected length. Thus an element a_i with a high probability of occurring in a message is encoded as a short binary string while an element with a low probability of occurring is encoded with a longer string. See also source coding.

单词	Huffman encoding
释义	Huffman encoding Computer A (usually) binary encoding of the elements of a finite set, A, $A = {a_{1}, a_{2}, \dots, a_{n}}$ where each element a_i in A has an assumed probability, p_i, of occurring in a message. The binary encoding satisfies the prefix property and is such that messages will have a minimum expected length. Thus an element a_i with a high probability of occurring in a message is encoded as a short binary string while an element with a low probability of occurring is encoded with a longer string. See also source coding.
随便看	‘Eohippus’ ‘explosive’ bolt ‘eye’ of storm ‘fight-or-flight’ response ‘hopper’ crystals ‘natural break’ ‘northern lights’ ‘Original Seven’ ‘patella’ beach ‘Plug’ strikes (1842) ‘Polflucht’ ‘Problematica’ ‘Snoopy’ helmet ‘tiger’s eye’ ‘wet chemistry’ ‘white smoker’ ‘zap pits’ ℂ ℂ∞ ℍ ℒ ℚ ℚp ℝ ℝn