huffman coding

H h

Transcription

- US Pronunciation
- US IPA

- US Pronunciation
- US IPA

Definitions of huffman coding words

noun Technical meaning of 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. 1
noun huffman coding (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). 0

See all 2 definitions of huffman coding

Information block about the term

Parts of speech for Huffman coding

noun

adjective

verb

adverb

pronoun

preposition

conjunction

determiner

exclamation

Full grammatical hierarchy of Huffman coding

See also

Matching words

Was this page helpful?

Yes No

Thank you for your feedback! Tell your friends about this page

Tell us why?