https://hackerpaper.kaipfister.de/p/1402.3392/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=32290315urn:hackerpapers:mention:1402.3392:32290315Sat, 30 Jul 2022 21:04:53 GMT<p>ANS is super fast and trivially parallelizable, faster than Huffman or especially arithmetic encoding, and is superior to Huffman at least as far as compression ratios are concerned (symbol probabilities are not restricted to powers of 2, but unlike arithmetic encoding one is usually limited to something close to multiples of 2^-9 to 2^-13 for symbol probabilities, the limitation being due to required table sizes for rANS or tANS in high speed memories or in L1 cache). It is fast because it can be machine word oriented (you can read/write whole machine word sizes at a time, not…</p><p><a href="https://hackerpaper.kaipfister.de/p/1402.3392/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.IThttps://news.ycombinator.com/item?id=14320205urn:hackerpapers:mention:1402.3392:14320205Thu, 11 May 2017 22:55:59 GMT<p>https://arxiv.org/abs/1402.3392</p><p><a href="https://hackerpaper.kaipfister.de/p/1402.3392/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.IT