Huffman coding

English

Etymology

Named after its inventor David A. Huffman (1925–1999).

Noun

Huffman coding (countable and uncountable, plural Huffman codings)

  1. (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).
    • 2018, Keshab K. Parhi, Takao Nishitami, editors, Digital Signal Processing for Multimedia Systems‎[1], CRC Press, →ISBN:
      In Huffman coding, shorter code-words are assigned to more frequent symbols so that the average code-length is reduced.

Hypernyms

Translations

Further reading

This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.