Teixi on Nostr: npub1t64z8…tu4j0 All models are either lossy or lossless flamboyant data ...

npub1t64z833rdxr8h50rzwn2k068edt6f8f9xpfg9qsx47ddx509lwtsttu4j0 (npub1t64…u4j0)

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