PivCo-Huffman
A novel approach to Huffman decoding, built on a wavelet-tree-style data layout.
PivCo-Huffman decodes data block-by-block via SIMD primitives that operate on per-node bitmaps rather than a code-after-code stream. In our benchmarks, it consistently beats the decode throughput of state-of-the-art Huffman codecs (Huff0, Oodle Huffman) by a large margin. Additionally, an extension that selectively applies ANS (PivCo-Huffman+ANS) reaches compression ratios approaching full FSE/tANS at much higher speeds.