Tag
This article provides a tutorial on file compression, explaining the basics of Huffman coding and DEFLATE algorithms, and includes an interactive playground for hands-on learning.
The author introduces their self-made link compressor Hammer, which doesn't rely on a database and can encode full links into short links via compression, making the generated QR codes easier to scan. This is an experimental project achieved through techniques such as removing redundancy, selecting an appropriate alphabet, and Huffman compression.
Reveals that MoE routing in LLMs follows a Frequency-Diversity Law analogous to Huffman coding, and proposes Subset Difference Pruning to eliminate functional redundancy and achieve optimal compression.
This blog post analyzes the PivCo-Huffman paper, which introduces 'merge' operations for parallel Huffman decoding, enabling efficient vectorized and GPU-friendly decoding without interleaving overhead.
This paper presents PivCo-Huffman, a new approach to Huffman coding using pivot coding from wavelet trees, enabling high-performance SIMD-friendly encoding and decoding. It consistently outperforms state-of-the-art Huffman codecs and shows how ANS coding can be selectively applied to skewed nodes to approach ANS compression ratios while preserving high decompression speeds.