Adaptive Huffman coding
Adaptive Huffman coding (also called Dynamic Huffman coding) is an adaptive coding technique based on Huffman coding. It permits building the code as the symbols are being transmitted, having no initial knowledge of source distribution, that allows one-pass encoding and adaptation to changing conditions in data. The benefit of one-pass procedure is that the source can be encoded in real time, though it becomes more sensitive to transmission errors, since just a single loss ruins the whole code.
primaryTopic
Adaptive Huffman coding
Adaptive Huffman coding (also called Dynamic Huffman coding) is an adaptive coding technique based on Huffman coding. It permits building the code as the symbols are being transmitted, having no initial knowledge of source distribution, that allows one-pass encoding and adaptation to changing conditions in data. The benefit of one-pass procedure is that the source can be encoded in real time, though it becomes more sensitive to transmission errors, since just a single loss ruins the whole code.
has abstract
Adaptive Huffman coding (also ...... gle loss ruins the whole code.
@en
Адаптивное кодирование Хаффман ...... озможность кодировать на лету.
@ru
طريقة ترميز هوفمان المتكيف (يس ...... نفقد المعلومة كلها (رمز كله).
@ar
適應性霍夫曼編碼(英语:Adaptive Huffman c ...... Sibling Property),由Gallager定義。
@zh
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
734.387.320
hypernym
type
comment
Adaptive Huffman coding (also ...... gle loss ruins the whole code.
@en
Адаптивное кодирование Хаффман ...... озможность кодировать на лету.
@ru
طريقة ترميز هوفمان المتكيف (يس ...... نفقد المعلومة كلها (رمز كله).
@ar
適應性霍夫曼編碼(英语:Adaptive Huffman c ...... Sibling Property),由Gallager定義。
@zh
label
Adaptive Huffman coding
@en
Адаптивный алгоритм Хаффмана
@ru
ترميز هوفمان المتكيف
@ar
適應性霍夫曼編碼
@zh