Huffman coding

noun1

1. •
   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