{"ID":3083836,"CreatedAt":"2026-06-05T06:46:15.197025399Z","UpdatedAt":"2026-06-07T06:37:52.911886358Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2606.05765","arxiv_id":"2606.05765","title":"PivCo-Huffman","abstract":"Huffman encoding has been an enduring technique for 70+ years, ubiquitous in compression algorithms since its invention. In this paper we propose a new approach to Huffman coding, based on a data structure from wavelet trees. The resulting pivot-coded Huffman (PivCo-Huffman) enables high-performance SIMD-friendly encoding and decoding operations. In our tests PivCo-Huffman consistently outperforms state-of-the-art Huffman codecs in decoding throughput. Additionally, we show how ANS-coding can be selectively applied to skewed nodes in this structure, yielding compression ratios approaching those of ANS-based codecs while preserving very high decompression speeds.","short_abstract":"Huffman encoding has been an enduring technique for 70+ years, ubiquitous in compression algorithms since its invention. In this paper we propose a new approach to Huffman coding, based on a data structure from wavelet trees. The resulting pivot-coded Huffman (PivCo-Huffman) enables high-performance SIMD-friendly encod...","url_abs":"https://arxiv.org/abs/2606.05765","url_pdf":"https://arxiv.org/pdf/2606.05765v1","authors":"[\"Marcin Zukowski\"]","published":"2026-06-04T06:46:07Z","proceeding":"cs.DS","tasks":"[\"cs.DS\",\"cs.PF\"]","methods":"[]","has_code":false}