1. A lossless data compression technique that uses probability distribution of symbols to assign variable-length codes, where more frequent symbols receive shorter codes
Huffman coding and arithmetic coding are common examples of entropy encoding algorithms.
Codificação de Huffman e codificação aritmética são exemplos comuns de algoritmos de codificação por entropia.
2. In information theory, a method of compressing data based on Shannon's entropy principle to approach the theoretical minimum number of bits required to represent information
Entropy encoding achieves compression rates close to the Shannon entropy limit of the source.
A codificação por entropia atinge taxas de compressão próximas ao limite de entropia de Shannon da fonte.