 |
| |||
| Huffman coding (An entropy encoding method for lossless data compression. It uses a variable length code table for encoding a source symbol (such as a character in a file) where the variable-length code table has been derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol) | |||