Huffman coding
التعريفات والمعاني
== English ==
=== Etymology ===
Named after its inventor David A. Huffman (1925–1999).
=== Noun ===
Huffman coding (countable and uncountable, plural Huffman codings)
(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).
==== Hypernyms ====
prefix coding
==== Translations ====
=== Further reading ===
Huffman coding on Wikipedia.Wikipedia