Teixi<p><span class="h-card" translate="no"><a href="https://sigmoid.social/@FroehlichMarcel" class="u-url mention" rel="nofollow noopener" target="_blank">@<span>FroehlichMarcel</span></a></span> </p><p>All models are either lossy or lossless flamboyant data compression trees?</p><p>Recalled reading this short brilliant thoughtful take:</p><p>Prefix-Free Code <br>&<br>Huffman Coding</p><p>» 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 «<br><a href="https://leimao.github.io/blog/Huffman-Coding/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">leimao.github.io/blog/Huffman-</span><span class="invisible">Coding/</span></a></p><p>another clear cut:<br><a href="https://control.com/technical-articles/huffman-coding-for-data-compression/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">control.com/technical-articles</span><span class="invisible">/huffman-coding-for-data-compression/</span></a></p><p><a href="https://mastodon.social/tags/PrefixCode" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>PrefixCode</span></a><br><a href="https://mastodon.social/tags/PrefixFreeCodeTree" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>PrefixFreeCodeTree</span></a><br><a href="https://mastodon.social/tags/HuffmanCode" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>HuffmanCode</span></a><br><a href="https://mastodon.social/tags/HuffmanTree" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>HuffmanTree</span></a><br><a href="https://mastodon.social/tags/DataCompression" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>DataCompression</span></a><br><a href="https://mastodon.social/tags/DataLoss" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>DataLoss</span></a></p>