<story><title>History of Lossless Data Compression Algorithms</title><url>http://ieeeghn.org/wiki/index.php/History_of_Lossless_Data_Compression_Algorithms</url></story><parent_chain></parent_chain><comment><author>derf_</author><text>Sadly, the description of arithmetic coding bears almost no resemblance to the actual algorithm (it roughly describes the equal probability case, but that misses most of the point). The description of Shannon-Fano as &amp;quot;bottom up&amp;quot; and Huffman as &amp;quot;top-down&amp;quot; is also exactly backwards (the actual descriptions of those algorithms are accurate, but the labeling is confused).&lt;p&gt;The article contains a lot of terms you can search for if you are interested in these things, but sadly is not very informative on its own.</text></comment>
<story><title>History of Lossless Data Compression Algorithms</title><url>http://ieeeghn.org/wiki/index.php/History_of_Lossless_Data_Compression_Algorithms</url></story><parent_chain></parent_chain><comment><author>adbge</author><text>If anyone is interested in the PAQ code, I have put one of the stronger-but-open-source variants on GitHub, here: &lt;a href=&quot;https://github.com/robertseaton/paq8pxd&quot; rel=&quot;nofollow&quot;&gt;https:&amp;#x2F;&amp;#x2F;github.com&amp;#x2F;robertseaton&amp;#x2F;paq8pxd&lt;/a&gt;</text></comment>