Huffman coding
Huffman coding noun: 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).
Noun
Huffman coding (countable and uncountable, plural Huffman codings)
- 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).
- In Huffman coding, shorter code-words are assigned to more frequent symbols so that the average code-length is reduced.2018, Keshab K. Parhi, Takao Nishitami, editors, Digital Signal Processing for Multimedia Systems, CRC Press, →ISBN
Forms of Huffman coding
| plural | Huffman codings |
|---|
Origin of Huffman coding
Named after its inventor David A. Huffman (1925–1999).
Questions about Huffman coding
- What does Huffman coding mean?
- Huffman coding means 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).
- What part of speech is Huffman coding?
- Huffman coding is a noun.
- What is the plural of Huffman coding?
- The plural of Huffman coding is Huffman codings.
Words near Huffman coding in the dictionary
Source and license
Adapted from Wiktionary: Huffman coding (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Huffman coding.” Word.ws, https://word.ws/huffman_coding. Based on Wiktionary, CC BY-SA 4.0.
