#Gzip 1.14 has been released (#GNU / #GNUZip / #Gz / #TarGz / #FileArchiver / #DataCompression / #DEFLATE / #LempelZiv / #LZ77 / #LempelZiv77 / #HuffmanCode) https://gnu.org/software/gzip/
All models are either lossy or lossless flamboyant data compression trees?
Recalled reading this short brilliant thoughtful take:
Prefix-Free Code
&
Huffman Coding
» The specialty of Huffman tree compared to an ordinary prefix-free code tree is that it minimizes the probability weighted mean of code length in the system «
https://leimao.github.io/blog/Huffman-Coding/
another clear cut:
https://control.com/technical-articles/huffman-coding-for-data-compression/
#PrefixCode
#PrefixFreeCodeTree
#HuffmanCode
#HuffmanTree
#DataCompression
#DataLoss